./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec3_product19.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec3_product19.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 0eb0a93133a0d165b4e13ef7269be4b8c3f0f81976a167102da919b09b6c6616 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:52:57,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:52:57,474 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:52:57,483 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:52:57,483 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:52:57,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:52:57,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:52:57,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:52:57,508 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:52:57,509 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:52:57,509 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:52:57,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:52:57,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:52:57,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:52:57,510 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:52:57,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:52:57,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:52:57,510 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:52:57,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:52:57,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:52:57,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:52:57,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:52:57,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:52:57,510 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:52:57,510 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:52:57,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:52:57,511 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:52:57,511 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:52:57,511 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:52:57,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:52:57,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:52:57,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:52:57,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:57,511 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:52:57,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:52:57,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:52:57,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:52:57,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:57,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:52:57,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:52:57,512 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:52:57,512 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:52:57,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:52:57,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:52:57,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:52:57,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:52:57,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:52:57,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:52:57,512 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 -> 0eb0a93133a0d165b4e13ef7269be4b8c3f0f81976a167102da919b09b6c6616 [2025-01-09 03:52:57,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:52:57,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:52:57,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:52:57,791 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:52:57,791 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:52:57,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec3_product19.cil.c [2025-01-09 03:52:58,969 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ca9e3bb0/d650c4fe224541c4a9bf0924f98fce69/FLAGfb3b47e4d [2025-01-09 03:52:59,340 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:52:59,341 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product19.cil.c [2025-01-09 03:52:59,355 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ca9e3bb0/d650c4fe224541c4a9bf0924f98fce69/FLAGfb3b47e4d [2025-01-09 03:52:59,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6ca9e3bb0/d650c4fe224541c4a9bf0924f98fce69 [2025-01-09 03:52:59,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:52:59,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:52:59,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:52:59,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:52:59,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:52:59,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:52:59" (1/1) ... [2025-01-09 03:52:59,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79da9237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:59, skipping insertion in model container [2025-01-09 03:52:59,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:52:59" (1/1) ... [2025-01-09 03:52:59,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:52:59,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product19.cil.c[8336,8349] [2025-01-09 03:52:59,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:52:59,794 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:52:59,800 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2025-01-09 03:52:59,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [66] [2025-01-09 03:52:59,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [115] [2025-01-09 03:52:59,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [431] [2025-01-09 03:52:59,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [440] [2025-01-09 03:52:59,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [498] [2025-01-09 03:52:59,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [723] [2025-01-09 03:52:59,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [821] [2025-01-09 03:52:59,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1895] [2025-01-09 03:52:59,802 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2170] [2025-01-09 03:52:59,803 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2571] [2025-01-09 03:52:59,814 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product19.cil.c[8336,8349] [2025-01-09 03:52:59,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:52:59,906 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:52:59,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:59 WrapperNode [2025-01-09 03:52:59,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:52:59,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:52:59,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:52:59,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:52:59,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:59" (1/1) ... [2025-01-09 03:52:59,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:59" (1/1) ... [2025-01-09 03:52:59,991 INFO L138 Inliner]: procedures = 128, calls = 192, calls flagged for inlining = 58, calls inlined = 53, statements flattened = 976 [2025-01-09 03:52:59,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:52:59,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:52:59,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:52:59,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:53:00,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:59" (1/1) ... [2025-01-09 03:53:00,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:59" (1/1) ... [2025-01-09 03:53:00,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:59" (1/1) ... [2025-01-09 03:53:00,045 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:53:00,048 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:59" (1/1) ... [2025-01-09 03:53:00,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:59" (1/1) ... [2025-01-09 03:53:00,065 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:59" (1/1) ... [2025-01-09 03:53:00,071 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:59" (1/1) ... [2025-01-09 03:53:00,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:59" (1/1) ... [2025-01-09 03:53:00,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:59" (1/1) ... [2025-01-09 03:53:00,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:59" (1/1) ... [2025-01-09 03:53:00,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:53:00,101 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:53:00,102 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:53:00,102 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:53:00,103 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:59" (1/1) ... [2025-01-09 03:53:00,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:53:00,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:00,133 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:53:00,136 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:53:00,155 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:53:00,155 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:53:00,155 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:53:00,155 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:53:00,155 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:53:00,155 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:53:00,155 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:53:00,156 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:53:00,156 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:53:00,156 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:53:00,156 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:53:00,156 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:53:00,156 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:53:00,156 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:53:00,156 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:53:00,156 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:53:00,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:53:00,156 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:53:00,156 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:53:00,156 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:53:00,157 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:53:00,157 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:53:00,157 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:53:00,157 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:53:00,157 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:53:00,157 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:53:00,157 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:53:00,157 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:53:00,157 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:53:00,157 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:53:00,157 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:53:00,157 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:53:00,157 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:53:00,157 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:53:00,157 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:53:00,157 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:53:00,158 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:53:00,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:53:00,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:53:00,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:53:00,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:53:00,158 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:53:00,158 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:53:00,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:53:00,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:53:00,296 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:53:00,300 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:53:00,953 INFO L? ?]: Removed 433 outVars from TransFormulas that were not future-live. [2025-01-09 03:53:00,953 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:53:00,969 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:53:00,969 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:53:00,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:53:00 BoogieIcfgContainer [2025-01-09 03:53:00,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:53:00,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:53:00,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:53:00,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:53:00,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:52:59" (1/3) ... [2025-01-09 03:53:00,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@765020f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:53:00, skipping insertion in model container [2025-01-09 03:53:00,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:59" (2/3) ... [2025-01-09 03:53:00,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@765020f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:53:00, skipping insertion in model container [2025-01-09 03:53:00,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:53:00" (3/3) ... [2025-01-09 03:53:00,977 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec3_product19.cil.c [2025-01-09 03:53:00,990 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:53:00,993 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec3_product19.cil.c that has 20 procedures, 322 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:53:01,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:53:01,071 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;@63362c51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:53:01,071 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:53:01,075 INFO L276 IsEmpty]: Start isEmpty. Operand has 322 states, 251 states have (on average 1.5179282868525896) internal successors, (381), 255 states have internal predecessors, (381), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 03:53:01,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 03:53:01,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:01,089 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:01,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:01,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:01,099 INFO L85 PathProgramCache]: Analyzing trace with hash 433790176, now seen corresponding path program 1 times [2025-01-09 03:53:01,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:01,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632314688] [2025-01-09 03:53:01,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:01,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:01,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 03:53:01,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 03:53:01,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:01,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:01,702 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 03:53:01,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:01,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632314688] [2025-01-09 03:53:01,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632314688] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:01,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256984410] [2025-01-09 03:53:01,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:01,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:01,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:01,710 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:53:01,711 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:53:01,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 03:53:01,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 03:53:01,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:01,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:01,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 03:53:02,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:53:02,023 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:53:02,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256984410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:02,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:53:02,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-01-09 03:53:02,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982960190] [2025-01-09 03:53:02,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:02,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:53:02,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:02,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:53:02,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:53:02,050 INFO L87 Difference]: Start difference. First operand has 322 states, 251 states have (on average 1.5179282868525896) internal successors, (381), 255 states have internal predecessors, (381), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:02,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:02,088 INFO L93 Difference]: Finished difference Result 490 states and 718 transitions. [2025-01-09 03:53:02,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:53:02,090 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 103 [2025-01-09 03:53:02,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:02,101 INFO L225 Difference]: With dead ends: 490 [2025-01-09 03:53:02,105 INFO L226 Difference]: Without dead ends: 314 [2025-01-09 03:53:02,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 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:53:02,110 INFO L435 NwaCegarLoop]: 476 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, 476 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:53:02,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:02,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-01-09 03:53:02,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2025-01-09 03:53:02,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 245 states have (on average 1.5142857142857142) internal successors, (371), 247 states have internal predecessors, (371), 50 states have call successors, (50), 19 states have call predecessors, (50), 18 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-01-09 03:53:02,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 468 transitions. [2025-01-09 03:53:02,159 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 468 transitions. Word has length 103 [2025-01-09 03:53:02,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:02,160 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 468 transitions. [2025-01-09 03:53:02,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:02,160 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 468 transitions. [2025-01-09 03:53:02,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 03:53:02,164 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:02,164 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:02,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:53:02,365 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:53:02,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:02,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:02,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2041386554, now seen corresponding path program 1 times [2025-01-09 03:53:02,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:02,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426300295] [2025-01-09 03:53:02,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:02,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:02,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 03:53:02,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 03:53:02,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:02,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 03:53:02,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:02,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426300295] [2025-01-09 03:53:02,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426300295] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:02,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461927987] [2025-01-09 03:53:02,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:02,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:02,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:02,656 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:53:02,662 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:53:02,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 03:53:02,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 03:53:02,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:02,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:02,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:53:02,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:53:02,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:53:02,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461927987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:02,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:53:02,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:53:02,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831294759] [2025-01-09 03:53:02,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:02,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:02,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:02,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:02,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:53:02,951 INFO L87 Difference]: Start difference. First operand 314 states and 468 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:02,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:02,987 INFO L93 Difference]: Finished difference Result 478 states and 695 transitions. [2025-01-09 03:53:02,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:02,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 103 [2025-01-09 03:53:02,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:02,990 INFO L225 Difference]: With dead ends: 478 [2025-01-09 03:53:02,990 INFO L226 Difference]: Without dead ends: 316 [2025-01-09 03:53:02,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 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:53:02,992 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 1 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 930 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:53:02,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 930 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:02,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-01-09 03:53:03,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 315. [2025-01-09 03:53:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 246 states have (on average 1.5121951219512195) internal successors, (372), 248 states have internal predecessors, (372), 50 states have call successors, (50), 19 states have call predecessors, (50), 18 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-01-09 03:53:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 469 transitions. [2025-01-09 03:53:03,008 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 469 transitions. Word has length 103 [2025-01-09 03:53:03,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:03,008 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 469 transitions. [2025-01-09 03:53:03,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:03,010 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 469 transitions. [2025-01-09 03:53:03,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 03:53:03,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:03,015 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:03,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:53:03,216 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:53:03,217 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:03,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:03,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1792178383, now seen corresponding path program 1 times [2025-01-09 03:53:03,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:03,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322522325] [2025-01-09 03:53:03,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:03,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:03,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:53:03,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:53:03,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:03,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:03,437 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:53:03,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:03,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322522325] [2025-01-09 03:53:03,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322522325] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:03,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867211589] [2025-01-09 03:53:03,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:03,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:03,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:03,441 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:53:03,443 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:53:03,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:53:03,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:53:03,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:03,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:03,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:53:03,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:03,693 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:53:03,694 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:53:03,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867211589] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:03,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:53:03,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:53:03,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948976565] [2025-01-09 03:53:03,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:03,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:03,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:03,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:03,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:53:03,697 INFO L87 Difference]: Start difference. First operand 315 states and 469 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:03,750 INFO L93 Difference]: Finished difference Result 660 states and 997 transitions. [2025-01-09 03:53:03,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:03,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 108 [2025-01-09 03:53:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:03,753 INFO L225 Difference]: With dead ends: 660 [2025-01-09 03:53:03,753 INFO L226 Difference]: Without dead ends: 371 [2025-01-09 03:53:03,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 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:53:03,754 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 107 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 899 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:53:03,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 899 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:03,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-01-09 03:53:03,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2025-01-09 03:53:03,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 283 states have (on average 1.530035335689046) internal successors, (433), 285 states have internal predecessors, (433), 61 states have call successors, (61), 19 states have call predecessors, (61), 18 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 03:53:03,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 552 transitions. [2025-01-09 03:53:03,784 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 552 transitions. Word has length 108 [2025-01-09 03:53:03,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:03,784 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 552 transitions. [2025-01-09 03:53:03,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:03,785 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 552 transitions. [2025-01-09 03:53:03,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 03:53:03,788 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:03,788 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:03,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 03:53:03,990 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:53:03,990 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:03,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:03,991 INFO L85 PathProgramCache]: Analyzing trace with hash -363147445, now seen corresponding path program 1 times [2025-01-09 03:53:03,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:03,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656831131] [2025-01-09 03:53:03,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:03,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:04,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:53:04,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:53:04,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:04,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:04,137 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:53:04,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:04,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656831131] [2025-01-09 03:53:04,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656831131] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:04,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081097381] [2025-01-09 03:53:04,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:04,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:04,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:04,142 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:53:04,150 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:53:04,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:53:04,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:53:04,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:04,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:04,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:53:04,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:53:04,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:53:04,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081097381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:04,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:53:04,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:53:04,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374520127] [2025-01-09 03:53:04,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:04,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:53:04,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:04,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:53:04,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:53:04,433 INFO L87 Difference]: Start difference. First operand 363 states and 552 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:04,496 INFO L93 Difference]: Finished difference Result 717 states and 1094 transitions. [2025-01-09 03:53:04,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:53:04,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 109 [2025-01-09 03:53:04,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:04,501 INFO L225 Difference]: With dead ends: 717 [2025-01-09 03:53:04,501 INFO L226 Difference]: Without dead ends: 365 [2025-01-09 03:53:04,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 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:53:04,503 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 2 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1829 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:53:04,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1829 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:04,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-01-09 03:53:04,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2025-01-09 03:53:04,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 284 states have (on average 1.528169014084507) internal successors, (434), 287 states have internal predecessors, (434), 61 states have call successors, (61), 19 states have call predecessors, (61), 19 states have return successors, (60), 58 states have call predecessors, (60), 58 states have call successors, (60) [2025-01-09 03:53:04,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 555 transitions. [2025-01-09 03:53:04,527 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 555 transitions. Word has length 109 [2025-01-09 03:53:04,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:04,527 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 555 transitions. [2025-01-09 03:53:04,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:04,528 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 555 transitions. [2025-01-09 03:53:04,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 03:53:04,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:04,531 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:04,538 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:53:04,731 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:53:04,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:04,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:04,732 INFO L85 PathProgramCache]: Analyzing trace with hash -132391268, now seen corresponding path program 1 times [2025-01-09 03:53:04,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:04,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171309894] [2025-01-09 03:53:04,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:04,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:04,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 03:53:04,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:53:04,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:04,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:04,881 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 03:53:04,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:04,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171309894] [2025-01-09 03:53:04,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171309894] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:04,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177127380] [2025-01-09 03:53:04,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:04,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:04,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:04,884 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:53:04,888 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:53:05,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 03:53:05,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:53:05,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:05,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:05,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:53:05,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:53:05,147 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:53:05,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177127380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:05,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:53:05,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:53:05,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036936066] [2025-01-09 03:53:05,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:05,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:53:05,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:05,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:53:05,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:53:05,149 INFO L87 Difference]: Start difference. First operand 365 states and 555 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:05,199 INFO L93 Difference]: Finished difference Result 719 states and 1099 transitions. [2025-01-09 03:53:05,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:53:05,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2025-01-09 03:53:05,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:05,202 INFO L225 Difference]: With dead ends: 719 [2025-01-09 03:53:05,202 INFO L226 Difference]: Without dead ends: 367 [2025-01-09 03:53:05,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 108 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:53:05,204 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 2 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1815 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:53:05,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1815 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:05,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-01-09 03:53:05,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2025-01-09 03:53:05,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 285 states have (on average 1.5263157894736843) internal successors, (435), 289 states have internal predecessors, (435), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (65), 58 states have call predecessors, (65), 58 states have call successors, (65) [2025-01-09 03:53:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 561 transitions. [2025-01-09 03:53:05,216 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 561 transitions. Word has length 110 [2025-01-09 03:53:05,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:05,217 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 561 transitions. [2025-01-09 03:53:05,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:05,217 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 561 transitions. [2025-01-09 03:53:05,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 03:53:05,218 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:05,218 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:05,226 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:53:05,419 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:53:05,421 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:05,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:05,421 INFO L85 PathProgramCache]: Analyzing trace with hash -598691107, now seen corresponding path program 1 times [2025-01-09 03:53:05,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:05,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34081678] [2025-01-09 03:53:05,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:05,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:05,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 03:53:05,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 03:53:05,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:05,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:05,533 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:53:05,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:05,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34081678] [2025-01-09 03:53:05,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34081678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:05,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:05,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:53:05,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650944071] [2025-01-09 03:53:05,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:05,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:53:05,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:05,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:53:05,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:53:05,535 INFO L87 Difference]: Start difference. First operand 367 states and 561 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:05,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:05,567 INFO L93 Difference]: Finished difference Result 711 states and 1090 transitions. [2025-01-09 03:53:05,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:53:05,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2025-01-09 03:53:05,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:05,570 INFO L225 Difference]: With dead ends: 711 [2025-01-09 03:53:05,570 INFO L226 Difference]: Without dead ends: 367 [2025-01-09 03:53:05,571 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:53:05,571 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 2 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1833 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:53:05,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1833 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:05,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-01-09 03:53:05,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2025-01-09 03:53:05,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 285 states have (on average 1.5263157894736843) internal successors, (435), 289 states have internal predecessors, (435), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (64), 58 states have call predecessors, (64), 58 states have call successors, (64) [2025-01-09 03:53:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 560 transitions. [2025-01-09 03:53:05,583 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 560 transitions. Word has length 111 [2025-01-09 03:53:05,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:05,583 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 560 transitions. [2025-01-09 03:53:05,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:05,583 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 560 transitions. [2025-01-09 03:53:05,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:53:05,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:05,585 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:05,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:53:05,585 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:05,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:05,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1893729204, now seen corresponding path program 2 times [2025-01-09 03:53:05,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:05,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430420168] [2025-01-09 03:53:05,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:53:05,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:05,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-01-09 03:53:05,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:53:05,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:53:05,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:05,679 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:53:05,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:05,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430420168] [2025-01-09 03:53:05,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430420168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:05,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:05,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:53:05,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395519620] [2025-01-09 03:53:05,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:05,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:53:05,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:05,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:53:05,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:53:05,681 INFO L87 Difference]: Start difference. First operand 367 states and 560 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:05,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:05,719 INFO L93 Difference]: Finished difference Result 709 states and 1085 transitions. [2025-01-09 03:53:05,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:53:05,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2025-01-09 03:53:05,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:05,722 INFO L225 Difference]: With dead ends: 709 [2025-01-09 03:53:05,722 INFO L226 Difference]: Without dead ends: 367 [2025-01-09 03:53:05,737 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:53:05,738 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 2 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:05,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1819 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:05,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-01-09 03:53:05,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2025-01-09 03:53:05,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 285 states have (on average 1.5263157894736843) internal successors, (435), 289 states have internal predecessors, (435), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (63), 58 states have call predecessors, (63), 58 states have call successors, (63) [2025-01-09 03:53:05,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 559 transitions. [2025-01-09 03:53:05,762 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 559 transitions. Word has length 112 [2025-01-09 03:53:05,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:05,762 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 559 transitions. [2025-01-09 03:53:05,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:05,763 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 559 transitions. [2025-01-09 03:53:05,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:53:05,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:05,764 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:53:05,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:53:05,764 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:05,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:05,765 INFO L85 PathProgramCache]: Analyzing trace with hash 156922347, now seen corresponding path program 3 times [2025-01-09 03:53:05,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:05,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996259435] [2025-01-09 03:53:05,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:53:05,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:05,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 113 statements into 3 equivalence classes. [2025-01-09 03:53:05,788 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 101 of 113 statements. [2025-01-09 03:53:05,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:53:05,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 03:53:05,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:05,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996259435] [2025-01-09 03:53:05,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996259435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:05,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:05,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:53:05,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823586118] [2025-01-09 03:53:05,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:05,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:53:05,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:05,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:53:05,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:53:05,895 INFO L87 Difference]: Start difference. First operand 367 states and 559 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:06,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:06,122 INFO L93 Difference]: Finished difference Result 848 states and 1230 transitions. [2025-01-09 03:53:06,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:53:06,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 113 [2025-01-09 03:53:06,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:06,126 INFO L225 Difference]: With dead ends: 848 [2025-01-09 03:53:06,126 INFO L226 Difference]: Without dead ends: 693 [2025-01-09 03:53:06,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:53:06,128 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 686 mSDsluCounter, 2185 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 2900 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:06,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 2900 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:53:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-01-09 03:53:06,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 683. [2025-01-09 03:53:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 537 states have (on average 1.4804469273743017) internal successors, (795), 544 states have internal predecessors, (795), 99 states have call successors, (99), 41 states have call predecessors, (99), 46 states have return successors, (108), 97 states have call predecessors, (108), 94 states have call successors, (108) [2025-01-09 03:53:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1002 transitions. [2025-01-09 03:53:06,153 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1002 transitions. Word has length 113 [2025-01-09 03:53:06,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:06,154 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 1002 transitions. [2025-01-09 03:53:06,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:06,154 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1002 transitions. [2025-01-09 03:53:06,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 03:53:06,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:06,156 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:53:06,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:53:06,156 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:06,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:06,157 INFO L85 PathProgramCache]: Analyzing trace with hash 577605901, now seen corresponding path program 1 times [2025-01-09 03:53:06,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:06,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645362634] [2025-01-09 03:53:06,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:06,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:06,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:53:06,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:53:06,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:06,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:53:06,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:06,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645362634] [2025-01-09 03:53:06,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645362634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:06,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:06,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:53:06,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199890467] [2025-01-09 03:53:06,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:06,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:53:06,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:06,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:53:06,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:53:06,290 INFO L87 Difference]: Start difference. First operand 683 states and 1002 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:06,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:06,342 INFO L93 Difference]: Finished difference Result 1345 states and 1977 transitions. [2025-01-09 03:53:06,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:53:06,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2025-01-09 03:53:06,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:06,347 INFO L225 Difference]: With dead ends: 1345 [2025-01-09 03:53:06,347 INFO L226 Difference]: Without dead ends: 685 [2025-01-09 03:53:06,349 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:53:06,350 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 1 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1836 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:53:06,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1836 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:06,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-01-09 03:53:06,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2025-01-09 03:53:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 538 states have (on average 1.479553903345725) internal successors, (796), 546 states have internal predecessors, (796), 99 states have call successors, (99), 41 states have call predecessors, (99), 47 states have return successors, (110), 97 states have call predecessors, (110), 94 states have call successors, (110) [2025-01-09 03:53:06,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1005 transitions. [2025-01-09 03:53:06,378 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1005 transitions. Word has length 114 [2025-01-09 03:53:06,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:06,378 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1005 transitions. [2025-01-09 03:53:06,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:06,378 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1005 transitions. [2025-01-09 03:53:06,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 03:53:06,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:06,380 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:06,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:53:06,380 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:06,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:06,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1905489789, now seen corresponding path program 1 times [2025-01-09 03:53:06,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:06,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056877440] [2025-01-09 03:53:06,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:06,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:06,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 03:53:06,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 03:53:06,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:06,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:06,497 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 03:53:06,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:06,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056877440] [2025-01-09 03:53:06,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056877440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:06,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:06,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:53:06,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052828115] [2025-01-09 03:53:06,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:06,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:53:06,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:06,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:53:06,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:53:06,499 INFO L87 Difference]: Start difference. First operand 685 states and 1005 transitions. Second operand has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-01-09 03:53:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:06,620 INFO L93 Difference]: Finished difference Result 1350 states and 1986 transitions. [2025-01-09 03:53:06,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:53:06,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 115 [2025-01-09 03:53:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:06,625 INFO L225 Difference]: With dead ends: 1350 [2025-01-09 03:53:06,625 INFO L226 Difference]: Without dead ends: 690 [2025-01-09 03:53:06,627 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:53:06,628 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 5 mSDsluCounter, 2695 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3149 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:06,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3149 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:53:06,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-01-09 03:53:06,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2025-01-09 03:53:06,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 542 states have (on average 1.477859778597786) internal successors, (801), 550 states have internal predecessors, (801), 99 states have call successors, (99), 42 states have call predecessors, (99), 48 states have return successors, (115), 97 states have call predecessors, (115), 94 states have call successors, (115) [2025-01-09 03:53:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1015 transitions. [2025-01-09 03:53:06,654 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1015 transitions. Word has length 115 [2025-01-09 03:53:06,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:06,654 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1015 transitions. [2025-01-09 03:53:06,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-01-09 03:53:06,655 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1015 transitions. [2025-01-09 03:53:06,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 03:53:06,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:06,656 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:06,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:53:06,656 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:06,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:06,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1758029167, now seen corresponding path program 1 times [2025-01-09 03:53:06,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:06,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157370930] [2025-01-09 03:53:06,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:06,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:06,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:53:06,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:53:06,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:06,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:06,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:06,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157370930] [2025-01-09 03:53:06,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157370930] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:06,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597839863] [2025-01-09 03:53:06,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:06,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:06,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:06,756 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:53:06,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:53:06,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:53:06,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:53:06,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:06,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:06,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:53:06,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:06,997 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:06,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:53:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:07,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597839863] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:53:07,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:53:07,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:53:07,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127913723] [2025-01-09 03:53:07,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:53:07,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:53:07,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:07,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:53:07,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:53:07,063 INFO L87 Difference]: Start difference. First operand 690 states and 1015 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:53:07,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:07,190 INFO L93 Difference]: Finished difference Result 1550 states and 2327 transitions. [2025-01-09 03:53:07,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:53:07,191 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 116 [2025-01-09 03:53:07,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:07,197 INFO L225 Difference]: With dead ends: 1550 [2025-01-09 03:53:07,197 INFO L226 Difference]: Without dead ends: 1072 [2025-01-09 03:53:07,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:53:07,200 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 317 mSDsluCounter, 1890 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 2399 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:07,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 2399 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:53:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-01-09 03:53:07,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1012. [2025-01-09 03:53:07,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 800 states have (on average 1.54125) internal successors, (1233), 808 states have internal predecessors, (1233), 163 states have call successors, (163), 42 states have call predecessors, (163), 48 states have return successors, (189), 161 states have call predecessors, (189), 158 states have call successors, (189) [2025-01-09 03:53:07,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1585 transitions. [2025-01-09 03:53:07,243 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1585 transitions. Word has length 116 [2025-01-09 03:53:07,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:07,244 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1585 transitions. [2025-01-09 03:53:07,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:53:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1585 transitions. [2025-01-09 03:53:07,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 03:53:07,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:07,248 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:07,256 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:53:07,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 03:53:07,449 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:07,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:07,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1978301584, now seen corresponding path program 1 times [2025-01-09 03:53:07,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:07,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330550974] [2025-01-09 03:53:07,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:07,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:07,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 03:53:07,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:53:07,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:07,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:07,498 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:07,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:07,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330550974] [2025-01-09 03:53:07,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330550974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:07,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:07,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:07,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174166172] [2025-01-09 03:53:07,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:07,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:07,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:07,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:07,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:07,500 INFO L87 Difference]: Start difference. First operand 1012 states and 1585 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:07,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:07,539 INFO L93 Difference]: Finished difference Result 2293 states and 3647 transitions. [2025-01-09 03:53:07,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:07,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2025-01-09 03:53:07,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:07,546 INFO L225 Difference]: With dead ends: 2293 [2025-01-09 03:53:07,546 INFO L226 Difference]: Without dead ends: 1350 [2025-01-09 03:53:07,549 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:53:07,550 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 105 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 938 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:53:07,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 938 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:07,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2025-01-09 03:53:07,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1330. [2025-01-09 03:53:07,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1054 states have (on average 1.5664136622390892) internal successors, (1651), 1062 states have internal predecessors, (1651), 227 states have call successors, (227), 42 states have call predecessors, (227), 48 states have return successors, (263), 225 states have call predecessors, (263), 222 states have call successors, (263) [2025-01-09 03:53:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 2141 transitions. [2025-01-09 03:53:07,597 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 2141 transitions. Word has length 123 [2025-01-09 03:53:07,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:07,597 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 2141 transitions. [2025-01-09 03:53:07,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 2141 transitions. [2025-01-09 03:53:07,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 03:53:07,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:07,602 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:07,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:53:07,602 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:07,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:07,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2011370425, now seen corresponding path program 1 times [2025-01-09 03:53:07,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:07,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466797898] [2025-01-09 03:53:07,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:07,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:07,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 03:53:07,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 03:53:07,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:07,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:07,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:07,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466797898] [2025-01-09 03:53:07,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466797898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:07,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:07,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:07,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578694610] [2025-01-09 03:53:07,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:07,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:07,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:07,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:07,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:07,647 INFO L87 Difference]: Start difference. First operand 1330 states and 2141 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:07,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:07,728 INFO L93 Difference]: Finished difference Result 3056 states and 4963 transitions. [2025-01-09 03:53:07,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:07,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2025-01-09 03:53:07,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:07,738 INFO L225 Difference]: With dead ends: 3056 [2025-01-09 03:53:07,738 INFO L226 Difference]: Without dead ends: 1846 [2025-01-09 03:53:07,742 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:53:07,743 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 103 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 930 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:53:07,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 930 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:07,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2025-01-09 03:53:07,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1826. [2025-01-09 03:53:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1455 states have (on average 1.5876288659793814) internal successors, (2310), 1463 states have internal predecessors, (2310), 322 states have call successors, (322), 42 states have call predecessors, (322), 48 states have return successors, (358), 320 states have call predecessors, (358), 317 states have call successors, (358) [2025-01-09 03:53:07,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2990 transitions. [2025-01-09 03:53:07,817 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2990 transitions. Word has length 124 [2025-01-09 03:53:07,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:07,818 INFO L471 AbstractCegarLoop]: Abstraction has 1826 states and 2990 transitions. [2025-01-09 03:53:07,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:07,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2990 transitions. [2025-01-09 03:53:07,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 03:53:07,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:07,825 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:07,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:53:07,826 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:07,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:07,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2004291186, now seen corresponding path program 1 times [2025-01-09 03:53:07,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:07,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190396089] [2025-01-09 03:53:07,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:07,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:07,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 03:53:07,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:53:07,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:07,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:07,872 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:07,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:07,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190396089] [2025-01-09 03:53:07,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190396089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:07,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:07,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:07,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076793803] [2025-01-09 03:53:07,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:07,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:07,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:07,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:07,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:07,874 INFO L87 Difference]: Start difference. First operand 1826 states and 2990 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:07,942 INFO L93 Difference]: Finished difference Result 4180 states and 6910 transitions. [2025-01-09 03:53:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:07,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2025-01-09 03:53:07,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:07,956 INFO L225 Difference]: With dead ends: 4180 [2025-01-09 03:53:07,956 INFO L226 Difference]: Without dead ends: 2595 [2025-01-09 03:53:07,962 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:53:07,963 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 101 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 925 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:53:07,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 925 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:07,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2595 states. [2025-01-09 03:53:08,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2595 to 2575. [2025-01-09 03:53:08,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2575 states, 2081 states have (on average 1.605478135511773) internal successors, (3341), 2089 states have internal predecessors, (3341), 445 states have call successors, (445), 42 states have call predecessors, (445), 48 states have return successors, (497), 443 states have call predecessors, (497), 440 states have call successors, (497) [2025-01-09 03:53:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2575 states and 4283 transitions. [2025-01-09 03:53:08,064 INFO L78 Accepts]: Start accepts. Automaton has 2575 states and 4283 transitions. Word has length 125 [2025-01-09 03:53:08,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:08,064 INFO L471 AbstractCegarLoop]: Abstraction has 2575 states and 4283 transitions. [2025-01-09 03:53:08,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:08,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2575 states and 4283 transitions. [2025-01-09 03:53:08,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 03:53:08,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:08,074 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:08,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:53:08,074 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:08,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:08,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1036784488, now seen corresponding path program 1 times [2025-01-09 03:53:08,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:08,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926812639] [2025-01-09 03:53:08,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:08,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:08,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 03:53:08,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 03:53:08,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:08,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:08,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:08,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926812639] [2025-01-09 03:53:08,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926812639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:08,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:08,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:08,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682137543] [2025-01-09 03:53:08,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:08,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:08,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:08,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:08,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:08,155 INFO L87 Difference]: Start difference. First operand 2575 states and 4283 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:08,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:08,249 INFO L93 Difference]: Finished difference Result 5928 states and 9941 transitions. [2025-01-09 03:53:08,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:08,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2025-01-09 03:53:08,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:08,269 INFO L225 Difference]: With dead ends: 5928 [2025-01-09 03:53:08,269 INFO L226 Difference]: Without dead ends: 3791 [2025-01-09 03:53:08,279 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:53:08,279 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 99 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 925 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:53:08,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 925 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3791 states. [2025-01-09 03:53:08,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3791 to 3771. [2025-01-09 03:53:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3771 states, 3098 states have (on average 1.618786313750807) internal successors, (5015), 3106 states have internal predecessors, (5015), 624 states have call successors, (624), 42 states have call predecessors, (624), 48 states have return successors, (702), 622 states have call predecessors, (702), 619 states have call successors, (702) [2025-01-09 03:53:08,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3771 states to 3771 states and 6341 transitions. [2025-01-09 03:53:08,443 INFO L78 Accepts]: Start accepts. Automaton has 3771 states and 6341 transitions. Word has length 126 [2025-01-09 03:53:08,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:08,444 INFO L471 AbstractCegarLoop]: Abstraction has 3771 states and 6341 transitions. [2025-01-09 03:53:08,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:08,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3771 states and 6341 transitions. [2025-01-09 03:53:08,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 03:53:08,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:08,458 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:08,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:53:08,458 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:08,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:08,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1541693646, now seen corresponding path program 1 times [2025-01-09 03:53:08,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:08,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860681351] [2025-01-09 03:53:08,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:08,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:08,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:53:08,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:53:08,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:08,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:08,503 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:08,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:08,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860681351] [2025-01-09 03:53:08,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860681351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:08,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:08,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:08,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601999826] [2025-01-09 03:53:08,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:08,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:08,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:08,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:08,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:08,505 INFO L87 Difference]: Start difference. First operand 3771 states and 6341 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:08,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:08,648 INFO L93 Difference]: Finished difference Result 8799 states and 14911 transitions. [2025-01-09 03:53:08,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:08,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2025-01-09 03:53:08,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:08,676 INFO L225 Difference]: With dead ends: 8799 [2025-01-09 03:53:08,677 INFO L226 Difference]: Without dead ends: 5767 [2025-01-09 03:53:08,688 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:53:08,688 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 97 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 932 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:53:08,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 932 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:08,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5767 states. [2025-01-09 03:53:08,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5747. [2025-01-09 03:53:08,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5747 states, 4698 states have (on average 1.6202639421030225) internal successors, (7612), 4706 states have internal predecessors, (7612), 1000 states have call successors, (1000), 42 states have call predecessors, (1000), 48 states have return successors, (1122), 998 states have call predecessors, (1122), 995 states have call successors, (1122) [2025-01-09 03:53:08,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5747 states to 5747 states and 9734 transitions. [2025-01-09 03:53:08,974 INFO L78 Accepts]: Start accepts. Automaton has 5747 states and 9734 transitions. Word has length 127 [2025-01-09 03:53:08,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:08,975 INFO L471 AbstractCegarLoop]: Abstraction has 5747 states and 9734 transitions. [2025-01-09 03:53:08,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:08,975 INFO L276 IsEmpty]: Start isEmpty. Operand 5747 states and 9734 transitions. [2025-01-09 03:53:08,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 03:53:08,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:08,995 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:08,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:53:08,995 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:08,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:08,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1357502196, now seen corresponding path program 1 times [2025-01-09 03:53:08,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:08,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196801352] [2025-01-09 03:53:08,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:08,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:09,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 03:53:09,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 03:53:09,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:09,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:09,058 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:09,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:09,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196801352] [2025-01-09 03:53:09,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196801352] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:09,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:09,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:09,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660488058] [2025-01-09 03:53:09,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:09,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:09,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:09,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:09,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:09,061 INFO L87 Difference]: Start difference. First operand 5747 states and 9734 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:09,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:09,276 INFO L93 Difference]: Finished difference Result 14003 states and 23888 transitions. [2025-01-09 03:53:09,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:09,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2025-01-09 03:53:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:09,330 INFO L225 Difference]: With dead ends: 14003 [2025-01-09 03:53:09,330 INFO L226 Difference]: Without dead ends: 9356 [2025-01-09 03:53:09,348 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:53:09,348 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 95 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 930 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:53:09,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 930 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:09,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9356 states. [2025-01-09 03:53:09,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9356 to 9336. [2025-01-09 03:53:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9336 states, 7681 states have (on average 1.622705376904049) internal successors, (12464), 7689 states have internal predecessors, (12464), 1606 states have call successors, (1606), 42 states have call predecessors, (1606), 48 states have return successors, (1806), 1604 states have call predecessors, (1806), 1601 states have call successors, (1806) [2025-01-09 03:53:09,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9336 states to 9336 states and 15876 transitions. [2025-01-09 03:53:09,712 INFO L78 Accepts]: Start accepts. Automaton has 9336 states and 15876 transitions. Word has length 128 [2025-01-09 03:53:09,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:09,712 INFO L471 AbstractCegarLoop]: Abstraction has 9336 states and 15876 transitions. [2025-01-09 03:53:09,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand 9336 states and 15876 transitions. [2025-01-09 03:53:09,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 03:53:09,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:09,733 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:09,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:53:09,733 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:09,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:09,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1159360868, now seen corresponding path program 1 times [2025-01-09 03:53:09,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:09,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920033032] [2025-01-09 03:53:09,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:09,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:09,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 03:53:09,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 03:53:09,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:09,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:09,826 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:09,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:09,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920033032] [2025-01-09 03:53:09,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920033032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:09,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:09,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:09,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390477855] [2025-01-09 03:53:09,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:09,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:09,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:09,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:09,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:09,829 INFO L87 Difference]: Start difference. First operand 9336 states and 15876 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:10,142 INFO L93 Difference]: Finished difference Result 23949 states and 40915 transitions. [2025-01-09 03:53:10,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:10,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2025-01-09 03:53:10,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:10,190 INFO L225 Difference]: With dead ends: 23949 [2025-01-09 03:53:10,190 INFO L226 Difference]: Without dead ends: 16143 [2025-01-09 03:53:10,212 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:53:10,212 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 93 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:10,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 941 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:10,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16143 states. [2025-01-09 03:53:10,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16143 to 16123. [2025-01-09 03:53:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16123 states, 13265 states have (on average 1.6162834526950622) internal successors, (21440), 13273 states have internal predecessors, (21440), 2809 states have call successors, (2809), 42 states have call predecessors, (2809), 48 states have return successors, (3153), 2807 states have call predecessors, (3153), 2804 states have call successors, (3153) [2025-01-09 03:53:10,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16123 states to 16123 states and 27402 transitions. [2025-01-09 03:53:10,862 INFO L78 Accepts]: Start accepts. Automaton has 16123 states and 27402 transitions. Word has length 129 [2025-01-09 03:53:10,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:10,862 INFO L471 AbstractCegarLoop]: Abstraction has 16123 states and 27402 transitions. [2025-01-09 03:53:10,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:10,863 INFO L276 IsEmpty]: Start isEmpty. Operand 16123 states and 27402 transitions. [2025-01-09 03:53:10,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 03:53:10,896 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:10,896 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:10,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:53:10,896 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:10,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:10,897 INFO L85 PathProgramCache]: Analyzing trace with hash 203504307, now seen corresponding path program 1 times [2025-01-09 03:53:10,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:10,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526806032] [2025-01-09 03:53:10,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:10,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:10,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 03:53:10,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 03:53:10,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:10,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:10,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:10,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526806032] [2025-01-09 03:53:10,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526806032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:10,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:10,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:10,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142232413] [2025-01-09 03:53:10,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:10,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:10,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:10,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:10,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:10,959 INFO L87 Difference]: Start difference. First operand 16123 states and 27402 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:11,768 INFO L93 Difference]: Finished difference Result 42475 states and 72534 transitions. [2025-01-09 03:53:11,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:11,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 130 [2025-01-09 03:53:11,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:11,871 INFO L225 Difference]: With dead ends: 42475 [2025-01-09 03:53:11,871 INFO L226 Difference]: Without dead ends: 28495 [2025-01-09 03:53:11,905 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:53:11,905 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 91 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:11,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 928 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:11,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28495 states. [2025-01-09 03:53:12,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28495 to 28475. [2025-01-09 03:53:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28475 states, 23578 states have (on average 1.6134108066841972) internal successors, (38041), 23586 states have internal predecessors, (38041), 4848 states have call successors, (4848), 42 states have call predecessors, (4848), 48 states have return successors, (5466), 4846 states have call predecessors, (5466), 4843 states have call successors, (5466) [2025-01-09 03:53:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28475 states to 28475 states and 48355 transitions. [2025-01-09 03:53:12,871 INFO L78 Accepts]: Start accepts. Automaton has 28475 states and 48355 transitions. Word has length 130 [2025-01-09 03:53:12,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:12,872 INFO L471 AbstractCegarLoop]: Abstraction has 28475 states and 48355 transitions. [2025-01-09 03:53:12,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:12,872 INFO L276 IsEmpty]: Start isEmpty. Operand 28475 states and 48355 transitions. [2025-01-09 03:53:12,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 03:53:12,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:12,905 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:12,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:53:12,905 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:12,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:12,906 INFO L85 PathProgramCache]: Analyzing trace with hash 770173346, now seen corresponding path program 1 times [2025-01-09 03:53:12,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:12,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878181187] [2025-01-09 03:53:12,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:12,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:13,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:53:13,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:53:13,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:13,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:13,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:13,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878181187] [2025-01-09 03:53:13,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878181187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:13,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:13,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:13,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784276826] [2025-01-09 03:53:13,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:13,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:13,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:13,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:13,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:13,132 INFO L87 Difference]: Start difference. First operand 28475 states and 48355 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:14,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:14,406 INFO L93 Difference]: Finished difference Result 77402 states and 131926 transitions. [2025-01-09 03:53:14,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:14,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 131 [2025-01-09 03:53:14,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:14,617 INFO L225 Difference]: With dead ends: 77402 [2025-01-09 03:53:14,617 INFO L226 Difference]: Without dead ends: 51805 [2025-01-09 03:53:14,696 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:53:14,698 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 89 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 929 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:53:14,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 929 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51805 states. [2025-01-09 03:53:16,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51805 to 51785. [2025-01-09 03:53:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51785 states, 43173 states have (on average 1.608435827948023) internal successors, (69441), 43181 states have internal predecessors, (69441), 8563 states have call successors, (8563), 42 states have call predecessors, (8563), 48 states have return successors, (9713), 8561 states have call predecessors, (9713), 8558 states have call successors, (9713) [2025-01-09 03:53:16,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51785 states to 51785 states and 87717 transitions. [2025-01-09 03:53:16,533 INFO L78 Accepts]: Start accepts. Automaton has 51785 states and 87717 transitions. Word has length 131 [2025-01-09 03:53:16,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:16,534 INFO L471 AbstractCegarLoop]: Abstraction has 51785 states and 87717 transitions. [2025-01-09 03:53:16,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:16,534 INFO L276 IsEmpty]: Start isEmpty. Operand 51785 states and 87717 transitions. [2025-01-09 03:53:16,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 03:53:16,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:16,573 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:16,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:53:16,573 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:16,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:16,574 INFO L85 PathProgramCache]: Analyzing trace with hash 552767027, now seen corresponding path program 1 times [2025-01-09 03:53:16,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:16,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986764271] [2025-01-09 03:53:16,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:16,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:16,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 03:53:16,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 03:53:16,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:16,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:16,622 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:16,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:16,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986764271] [2025-01-09 03:53:16,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986764271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:16,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:16,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:16,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174271470] [2025-01-09 03:53:16,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:16,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:16,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:16,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:16,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:16,624 INFO L87 Difference]: Start difference. First operand 51785 states and 87717 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:18,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:18,460 INFO L93 Difference]: Finished difference Result 96654 states and 164025 transitions. [2025-01-09 03:53:18,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:18,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 132 [2025-01-09 03:53:18,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:18,836 INFO L225 Difference]: With dead ends: 96654 [2025-01-09 03:53:18,837 INFO L226 Difference]: Without dead ends: 96176 [2025-01-09 03:53:18,888 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:53:18,889 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 84 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:18,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 934 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:18,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96176 states. [2025-01-09 03:53:21,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96176 to 96156. [2025-01-09 03:53:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96156 states, 80745 states have (on average 1.6016223914793486) internal successors, (129323), 80753 states have internal predecessors, (129323), 15362 states have call successors, (15362), 42 states have call predecessors, (15362), 48 states have return successors, (17558), 15360 states have call predecessors, (17558), 15357 states have call successors, (17558) [2025-01-09 03:53:22,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96156 states to 96156 states and 162243 transitions. [2025-01-09 03:53:22,635 INFO L78 Accepts]: Start accepts. Automaton has 96156 states and 162243 transitions. Word has length 132 [2025-01-09 03:53:22,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:22,639 INFO L471 AbstractCegarLoop]: Abstraction has 96156 states and 162243 transitions. [2025-01-09 03:53:22,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:22,640 INFO L276 IsEmpty]: Start isEmpty. Operand 96156 states and 162243 transitions. [2025-01-09 03:53:22,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 03:53:22,759 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:22,759 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:22,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:53:22,759 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:22,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:22,760 INFO L85 PathProgramCache]: Analyzing trace with hash -457484701, now seen corresponding path program 1 times [2025-01-09 03:53:22,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:22,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556658700] [2025-01-09 03:53:22,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:22,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:22,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 03:53:22,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 03:53:22,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:22,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:23,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:23,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556658700] [2025-01-09 03:53:23,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556658700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:23,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:23,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 03:53:23,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912029159] [2025-01-09 03:53:23,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:23,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:53:23,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:23,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:53:23,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:53:23,030 INFO L87 Difference]: Start difference. First operand 96156 states and 162243 transitions. Second operand has 11 states, 9 states have (on average 10.11111111111111) internal successors, (91), 10 states have internal predecessors, (91), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-09 03:53:25,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:25,049 INFO L93 Difference]: Finished difference Result 96712 states and 163033 transitions. [2025-01-09 03:53:25,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:53:25,050 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 10.11111111111111) internal successors, (91), 10 states have internal predecessors, (91), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 133 [2025-01-09 03:53:25,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:25,543 INFO L225 Difference]: With dead ends: 96712 [2025-01-09 03:53:25,544 INFO L226 Difference]: Without dead ends: 96120 [2025-01-09 03:53:25,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-01-09 03:53:25,584 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 125 mSDsluCounter, 4114 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 4573 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:25,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 4573 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:53:25,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96120 states. [2025-01-09 03:53:28,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96120 to 96112. [2025-01-09 03:53:28,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96112 states, 80710 states have (on average 1.6017346053772767) internal successors, (129276), 80718 states have internal predecessors, (129276), 15356 states have call successors, (15356), 41 states have call predecessors, (15356), 45 states have return successors, (17551), 15352 states have call predecessors, (17551), 15352 states have call successors, (17551) [2025-01-09 03:53:29,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96112 states to 96112 states and 162183 transitions. [2025-01-09 03:53:29,053 INFO L78 Accepts]: Start accepts. Automaton has 96112 states and 162183 transitions. Word has length 133 [2025-01-09 03:53:29,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:29,054 INFO L471 AbstractCegarLoop]: Abstraction has 96112 states and 162183 transitions. [2025-01-09 03:53:29,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 10.11111111111111) internal successors, (91), 10 states have internal predecessors, (91), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-09 03:53:29,054 INFO L276 IsEmpty]: Start isEmpty. Operand 96112 states and 162183 transitions. [2025-01-09 03:53:29,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 03:53:29,100 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:29,100 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:29,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:53:29,101 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:29,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:29,101 INFO L85 PathProgramCache]: Analyzing trace with hash -2023505377, now seen corresponding path program 1 times [2025-01-09 03:53:29,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:29,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340989314] [2025-01-09 03:53:29,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:29,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:29,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 03:53:29,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 03:53:29,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:29,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:53:29,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:29,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340989314] [2025-01-09 03:53:29,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340989314] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:29,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730950554] [2025-01-09 03:53:29,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:29,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:29,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:29,825 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:53:29,826 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:53:29,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 03:53:30,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 03:53:30,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:30,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:30,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 03:53:30,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:30,359 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:53:30,359 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:53:30,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730950554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:30,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:53:30,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2025-01-09 03:53:30,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207528429] [2025-01-09 03:53:30,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:30,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 03:53:30,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:30,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 03:53:30,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2025-01-09 03:53:30,360 INFO L87 Difference]: Start difference. First operand 96112 states and 162183 transitions. Second operand has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-09 03:53:32,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:32,937 INFO L93 Difference]: Finished difference Result 96808 states and 163149 transitions. [2025-01-09 03:53:32,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 03:53:32,937 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) Word has length 136 [2025-01-09 03:53:32,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:33,497 INFO L225 Difference]: With dead ends: 96808 [2025-01-09 03:53:33,497 INFO L226 Difference]: Without dead ends: 96628 [2025-01-09 03:53:33,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=1541, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 03:53:33,586 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 741 mSDsluCounter, 4841 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 5342 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:33,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 5342 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:53:33,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96628 states. [2025-01-09 03:53:36,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96628 to 96554. [2025-01-09 03:53:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96554 states, 81056 states have (on average 1.6009548953809711) internal successors, (129767), 81074 states have internal predecessors, (129767), 15413 states have call successors, (15413), 71 states have call predecessors, (15413), 84 states have return successors, (17625), 15408 states have call predecessors, (17625), 15407 states have call successors, (17625) [2025-01-09 03:53:36,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96554 states to 96554 states and 162805 transitions. [2025-01-09 03:53:36,841 INFO L78 Accepts]: Start accepts. Automaton has 96554 states and 162805 transitions. Word has length 136 [2025-01-09 03:53:36,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:36,842 INFO L471 AbstractCegarLoop]: Abstraction has 96554 states and 162805 transitions. [2025-01-09 03:53:36,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-09 03:53:36,842 INFO L276 IsEmpty]: Start isEmpty. Operand 96554 states and 162805 transitions. [2025-01-09 03:53:36,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 03:53:36,891 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:36,892 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:36,903 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:53:37,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:37,093 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:37,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:37,093 INFO L85 PathProgramCache]: Analyzing trace with hash 187084681, now seen corresponding path program 1 times [2025-01-09 03:53:37,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:37,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018618825] [2025-01-09 03:53:37,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:37,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:37,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 03:53:37,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 03:53:37,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:37,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:37,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:37,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018618825] [2025-01-09 03:53:37,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018618825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:37,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:37,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 03:53:37,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146473333] [2025-01-09 03:53:37,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:37,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 03:53:37,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:37,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 03:53:37,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:53:37,445 INFO L87 Difference]: Start difference. First operand 96554 states and 162805 transitions. Second operand has 13 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 states have internal predecessors, (95), 6 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-09 03:53:40,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:40,135 INFO L93 Difference]: Finished difference Result 96935 states and 163326 transitions. [2025-01-09 03:53:40,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 03:53:40,136 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.916666666666667) internal successors, (95), 11 states have internal predecessors, (95), 6 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) Word has length 137 [2025-01-09 03:53:40,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:40,842 INFO L225 Difference]: With dead ends: 96935 [2025-01-09 03:53:40,842 INFO L226 Difference]: Without dead ends: 96630 [2025-01-09 03:53:40,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=797, Unknown=0, NotChecked=0, Total=930 [2025-01-09 03:53:40,892 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 776 mSDsluCounter, 4823 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 5323 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:40,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 5323 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 03:53:40,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96630 states.