./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product28.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product28.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f29cc89d3ee64e709bcde3f8f1e5c1c29a2d05992b7eca470a9d177af894449a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:53:00,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:53:00,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:53:00,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:53:00,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:53:00,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:53:00,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:53:00,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:53:00,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:53:00,154 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:53:00,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:53:00,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:53:00,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:53:00,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:53:00,156 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:53:00,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:53:00,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:53:00,157 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:53:00,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:53:00,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:53:00,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:53:00,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:53:00,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:53:00,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:53:00,161 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:53:00,161 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:53:00,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:53:00,162 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:53:00,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:53:00,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:53:00,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:53:00,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:53:00,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:53:00,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:53:00,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:53:00,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:53:00,165 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:53:00,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:53:00,166 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:53:00,166 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:53:00,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:53:00,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:53:00,167 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f29cc89d3ee64e709bcde3f8f1e5c1c29a2d05992b7eca470a9d177af894449a [2024-10-11 02:53:00,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:53:00,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:53:00,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:53:00,480 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:53:00,481 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:53:00,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product28.cil.c [2024-10-11 02:53:01,925 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:53:02,208 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:53:02,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product28.cil.c [2024-10-11 02:53:02,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/da8bcad3e/96bf19cc7cb9436b9d3b2a3ad91a8e18/FLAG478b57f5f [2024-10-11 02:53:02,247 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/da8bcad3e/96bf19cc7cb9436b9d3b2a3ad91a8e18 [2024-10-11 02:53:02,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:53:02,251 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:53:02,253 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:53:02,253 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:53:02,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:53:02,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:53:02" (1/1) ... [2024-10-11 02:53:02,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c31374c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:02, skipping insertion in model container [2024-10-11 02:53:02,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:53:02" (1/1) ... [2024-10-11 02:53:02,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:53:02,502 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product28.cil.c[1542,1555] [2024-10-11 02:53:02,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:53:02,864 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:53:02,879 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2024-10-11 02:53:02,881 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [57] [2024-10-11 02:53:02,882 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [217] [2024-10-11 02:53:02,882 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [255] [2024-10-11 02:53:02,882 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [591] [2024-10-11 02:53:02,882 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [871] [2024-10-11 02:53:02,883 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptVerify_spec.i","") [1084] [2024-10-11 02:53:02,883 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1102] [2024-10-11 02:53:02,883 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1468] [2024-10-11 02:53:02,883 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1485] [2024-10-11 02:53:02,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2554] [2024-10-11 02:53:02,887 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product28.cil.c[1542,1555] [2024-10-11 02:53:03,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:53:03,102 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:53:03,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:03 WrapperNode [2024-10-11 02:53:03,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:53:03,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:53:03,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:53:03,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:53:03,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:03" (1/1) ... [2024-10-11 02:53:03,151 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:03" (1/1) ... [2024-10-11 02:53:03,205 INFO L138 Inliner]: procedures = 128, calls = 195, calls flagged for inlining = 55, calls inlined = 45, statements flattened = 845 [2024-10-11 02:53:03,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:53:03,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:53:03,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:53:03,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:53:03,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:03" (1/1) ... [2024-10-11 02:53:03,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:03" (1/1) ... [2024-10-11 02:53:03,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:03" (1/1) ... [2024-10-11 02:53:03,261 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]. [2024-10-11 02:53:03,262 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:03" (1/1) ... [2024-10-11 02:53:03,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:03" (1/1) ... [2024-10-11 02:53:03,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:03" (1/1) ... [2024-10-11 02:53:03,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:03" (1/1) ... [2024-10-11 02:53:03,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:03" (1/1) ... [2024-10-11 02:53:03,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:03" (1/1) ... [2024-10-11 02:53:03,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:53:03,308 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:53:03,308 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:53:03,308 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:53:03,309 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:03" (1/1) ... [2024-10-11 02:53:03,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:53:03,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:53:03,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:53:03,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:53:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-10-11 02:53:03,403 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-10-11 02:53:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-10-11 02:53:03,403 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-10-11 02:53:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-10-11 02:53:03,403 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-10-11 02:53:03,403 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-11 02:53:03,405 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-11 02:53:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-11 02:53:03,405 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-11 02:53:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-11 02:53:03,405 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-11 02:53:03,406 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-11 02:53:03,406 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-11 02:53:03,407 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-10-11 02:53:03,407 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-10-11 02:53:03,407 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-11 02:53:03,408 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-11 02:53:03,409 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-11 02:53:03,409 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-11 02:53:03,409 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-11 02:53:03,409 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-11 02:53:03,409 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-11 02:53:03,409 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-11 02:53:03,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:53:03,410 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-11 02:53:03,410 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-11 02:53:03,410 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-11 02:53:03,410 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-11 02:53:03,410 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-11 02:53:03,410 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-11 02:53:03,410 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-11 02:53:03,411 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-11 02:53:03,411 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-11 02:53:03,411 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-11 02:53:03,411 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-10-11 02:53:03,411 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-10-11 02:53:03,411 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-11 02:53:03,411 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-11 02:53:03,411 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-10-11 02:53:03,411 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-10-11 02:53:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-11 02:53:03,412 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-11 02:53:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:53:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:53:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:53:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:53:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-11 02:53:03,412 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-11 02:53:03,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:53:03,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:53:03,596 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:53:03,599 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:53:04,410 INFO L? ?]: Removed 395 outVars from TransFormulas that were not future-live. [2024-10-11 02:53:04,411 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:53:04,485 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:53:04,485 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:53:04,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:53:04 BoogieIcfgContainer [2024-10-11 02:53:04,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:53:04,490 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:53:04,491 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:53:04,494 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:53:04,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:53:02" (1/3) ... [2024-10-11 02:53:04,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@140173cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:53:04, skipping insertion in model container [2024-10-11 02:53:04,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:53:03" (2/3) ... [2024-10-11 02:53:04,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@140173cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:53:04, skipping insertion in model container [2024-10-11 02:53:04,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:53:04" (3/3) ... [2024-10-11 02:53:04,498 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec7_product28.cil.c [2024-10-11 02:53:04,515 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:53:04,515 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:53:04,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:53:04,608 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;@3113052c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:53:04,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:53:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 300 states, 227 states have (on average 1.577092511013216) internal successors, (358), 231 states have internal predecessors, (358), 49 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-11 02:53:04,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 02:53:04,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:04,635 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:04,636 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:04,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:04,641 INFO L85 PathProgramCache]: Analyzing trace with hash 995138365, now seen corresponding path program 1 times [2024-10-11 02:53:04,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:04,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712801575] [2024-10-11 02:53:04,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:04,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:05,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:05,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:05,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:05,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:53:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:05,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:53:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:05,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:53:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:05,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:53:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:05,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:53:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:05,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:53:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:05,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:53:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:05,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:53:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:05,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:53:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:05,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:53:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:05,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:53:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:05,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:53:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:53:05,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:05,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712801575] [2024-10-11 02:53:05,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712801575] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:53:05,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114519924] [2024-10-11 02:53:05,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:05,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:53:05,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:53:05,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:53:05,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:53:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:05,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 02:53:05,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:53:05,868 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 02:53:05,868 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:53:05,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114519924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:05,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:53:05,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-10-11 02:53:05,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93914421] [2024-10-11 02:53:05,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:05,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:53:05,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:05,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:53:05,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:53:05,909 INFO L87 Difference]: Start difference. First operand has 300 states, 227 states have (on average 1.577092511013216) internal successors, (358), 231 states have internal predecessors, (358), 49 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:06,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:06,003 INFO L93 Difference]: Finished difference Result 459 states and 682 transitions. [2024-10-11 02:53:06,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:53:06,006 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 111 [2024-10-11 02:53:06,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:06,024 INFO L225 Difference]: With dead ends: 459 [2024-10-11 02:53:06,025 INFO L226 Difference]: Without dead ends: 297 [2024-10-11 02:53:06,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:53:06,036 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:06,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:53:06,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-11 02:53:06,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2024-10-11 02:53:06,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 225 states have (on average 1.56) internal successors, (351), 228 states have internal predecessors, (351), 49 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 02:53:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 448 transitions. [2024-10-11 02:53:06,124 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 448 transitions. Word has length 111 [2024-10-11 02:53:06,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:06,129 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 448 transitions. [2024-10-11 02:53:06,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:06,129 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 448 transitions. [2024-10-11 02:53:06,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 02:53:06,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:06,139 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:06,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:53:06,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-11 02:53:06,344 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:06,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:06,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2091278568, now seen corresponding path program 1 times [2024-10-11 02:53:06,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:06,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895501218] [2024-10-11 02:53:06,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:06,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:53:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:53:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:53:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:53:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:53:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:53:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:53:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:53:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:53:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:53:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:53:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:53:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,695 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:53:06,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:06,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895501218] [2024-10-11 02:53:06,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895501218] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:53:06,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228501262] [2024-10-11 02:53:06,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:06,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:53:06,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:53:06,700 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:53:06,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:53:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:06,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:53:07,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:53:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 02:53:07,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:53:07,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228501262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:07,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:53:07,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 02:53:07,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697385536] [2024-10-11 02:53:07,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:07,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:53:07,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:07,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:53:07,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:53:07,039 INFO L87 Difference]: Start difference. First operand 297 states and 448 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, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:07,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:07,097 INFO L93 Difference]: Finished difference Result 455 states and 669 transitions. [2024-10-11 02:53:07,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:53:07,098 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, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 112 [2024-10-11 02:53:07,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:07,102 INFO L225 Difference]: With dead ends: 455 [2024-10-11 02:53:07,104 INFO L226 Difference]: Without dead ends: 299 [2024-10-11 02:53:07,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:53:07,107 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 0 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:07,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 877 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:53:07,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-11 02:53:07,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2024-10-11 02:53:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 227 states have (on average 1.5550660792951543) internal successors, (353), 230 states have internal predecessors, (353), 49 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 02:53:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 450 transitions. [2024-10-11 02:53:07,136 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 450 transitions. Word has length 112 [2024-10-11 02:53:07,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:07,140 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 450 transitions. [2024-10-11 02:53:07,140 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, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:07,140 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 450 transitions. [2024-10-11 02:53:07,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 02:53:07,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:07,142 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:07,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:53:07,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:53:07,344 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:07,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:07,345 INFO L85 PathProgramCache]: Analyzing trace with hash 374569795, now seen corresponding path program 1 times [2024-10-11 02:53:07,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:07,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095364867] [2024-10-11 02:53:07,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:07,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:07,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:07,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:07,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:07,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:53:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:07,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:53:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:07,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:53:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:07,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:53:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:07,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:53:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:07,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:53:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:07,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:53:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:07,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:53:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:07,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:53:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:07,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:53:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:07,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:53:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:07,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:53:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:07,656 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 02:53:07,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:07,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095364867] [2024-10-11 02:53:07,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095364867] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:53:07,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773342752] [2024-10-11 02:53:07,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:07,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:53:07,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:53:07,660 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:53:07,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:53:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:07,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:53:07,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:53:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 02:53:07,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:53:07,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773342752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:07,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:53:07,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 02:53:07,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479831646] [2024-10-11 02:53:07,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:07,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:53:07,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:07,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:53:07,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:53:07,989 INFO L87 Difference]: Start difference. First operand 299 states and 450 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:08,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:08,034 INFO L93 Difference]: Finished difference Result 624 states and 952 transitions. [2024-10-11 02:53:08,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:53:08,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 117 [2024-10-11 02:53:08,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:08,038 INFO L225 Difference]: With dead ends: 624 [2024-10-11 02:53:08,038 INFO L226 Difference]: Without dead ends: 347 [2024-10-11 02:53:08,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:53:08,040 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 95 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:08,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 844 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:53:08,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-10-11 02:53:08,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 342. [2024-10-11 02:53:08,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 259 states have (on average 1.5675675675675675) internal successors, (406), 262 states have internal predecessors, (406), 60 states have call successors, (60), 22 states have call predecessors, (60), 22 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-11 02:53:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 525 transitions. [2024-10-11 02:53:08,062 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 525 transitions. Word has length 117 [2024-10-11 02:53:08,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:08,063 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 525 transitions. [2024-10-11 02:53:08,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 525 transitions. [2024-10-11 02:53:08,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 02:53:08,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:08,065 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:08,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 02:53:08,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:53:08,267 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:08,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:08,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1245588724, now seen corresponding path program 1 times [2024-10-11 02:53:08,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:08,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895957556] [2024-10-11 02:53:08,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:08,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:08,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:08,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:08,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:08,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:53:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:08,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:53:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:08,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:53:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:08,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:53:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:08,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:53:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:08,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:53:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:08,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:53:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:08,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:53:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:08,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:53:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:08,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:53:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:08,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:53:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:08,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:53:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 02:53:08,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:08,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895957556] [2024-10-11 02:53:08,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895957556] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:53:08,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282671317] [2024-10-11 02:53:08,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:08,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:53:08,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:53:08,512 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:53:08,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 02:53:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:08,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 02:53:08,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:53:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 02:53:08,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:53:08,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282671317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:08,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:53:08,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-10-11 02:53:08,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144508304] [2024-10-11 02:53:08,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:08,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:53:08,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:08,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:53:08,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:53:08,859 INFO L87 Difference]: Start difference. First operand 342 states and 525 transitions. Second operand has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 02:53:08,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:08,936 INFO L93 Difference]: Finished difference Result 679 states and 1044 transitions. [2024-10-11 02:53:08,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:53:08,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 118 [2024-10-11 02:53:08,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:08,940 INFO L225 Difference]: With dead ends: 679 [2024-10-11 02:53:08,940 INFO L226 Difference]: Without dead ends: 344 [2024-10-11 02:53:08,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:53:08,944 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 2 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:08,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1713 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:53:08,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-11 02:53:08,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2024-10-11 02:53:08,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 260 states have (on average 1.5653846153846154) internal successors, (407), 264 states have internal predecessors, (407), 60 states have call successors, (60), 22 states have call predecessors, (60), 23 states have return successors, (61), 59 states have call predecessors, (61), 59 states have call successors, (61) [2024-10-11 02:53:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 528 transitions. [2024-10-11 02:53:08,969 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 528 transitions. Word has length 118 [2024-10-11 02:53:08,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:08,970 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 528 transitions. [2024-10-11 02:53:08,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 02:53:08,971 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 528 transitions. [2024-10-11 02:53:08,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 02:53:08,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:08,974 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:08,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 02:53:09,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:53:09,179 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:09,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:09,180 INFO L85 PathProgramCache]: Analyzing trace with hash -386544615, now seen corresponding path program 1 times [2024-10-11 02:53:09,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:09,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498489426] [2024-10-11 02:53:09,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:09,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:53:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:53:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:53:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:53:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:53:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:53:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:53:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:53:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:53:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:53:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:53:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,437 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 02:53:09,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:09,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498489426] [2024-10-11 02:53:09,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498489426] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:53:09,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406198247] [2024-10-11 02:53:09,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:09,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:53:09,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:53:09,441 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:53:09,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 02:53:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:09,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 02:53:09,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:53:09,795 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 02:53:09,795 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:53:09,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406198247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:09,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:53:09,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-10-11 02:53:09,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098108] [2024-10-11 02:53:09,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:09,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:53:09,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:09,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:53:09,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:53:09,798 INFO L87 Difference]: Start difference. First operand 344 states and 528 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 02:53:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:09,900 INFO L93 Difference]: Finished difference Result 681 states and 1049 transitions. [2024-10-11 02:53:09,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:53:09,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 119 [2024-10-11 02:53:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:09,904 INFO L225 Difference]: With dead ends: 681 [2024-10-11 02:53:09,904 INFO L226 Difference]: Without dead ends: 346 [2024-10-11 02:53:09,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:53:09,906 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 2 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:09,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1699 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:53:09,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-11 02:53:09,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2024-10-11 02:53:09,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 266 states have internal predecessors, (408), 60 states have call successors, (60), 22 states have call predecessors, (60), 24 states have return successors, (66), 59 states have call predecessors, (66), 59 states have call successors, (66) [2024-10-11 02:53:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 534 transitions. [2024-10-11 02:53:09,924 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 534 transitions. Word has length 119 [2024-10-11 02:53:09,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:09,925 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 534 transitions. [2024-10-11 02:53:09,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 02:53:09,925 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 534 transitions. [2024-10-11 02:53:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 02:53:09,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:09,929 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:09,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 02:53:10,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:53:10,130 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:10,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:10,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1435500918, now seen corresponding path program 1 times [2024-10-11 02:53:10,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:10,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909194875] [2024-10-11 02:53:10,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:10,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:10,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:10,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:10,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:10,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:10,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:10,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:53:10,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:10,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:53:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:10,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:53:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:10,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:53:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:10,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:53:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:10,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:53:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:10,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:53:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:10,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:53:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:10,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:53:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:10,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:53:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:10,360 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 02:53:10,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:10,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909194875] [2024-10-11 02:53:10,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909194875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:10,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:10,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:53:10,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454254629] [2024-10-11 02:53:10,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:10,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:53:10,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:10,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:53:10,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:53:10,363 INFO L87 Difference]: Start difference. First operand 346 states and 534 transitions. Second operand has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 02:53:11,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:11,859 INFO L93 Difference]: Finished difference Result 732 states and 1137 transitions. [2024-10-11 02:53:11,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:53:11,860 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 120 [2024-10-11 02:53:11,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:11,864 INFO L225 Difference]: With dead ends: 732 [2024-10-11 02:53:11,866 INFO L226 Difference]: Without dead ends: 405 [2024-10-11 02:53:11,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:53:11,868 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 728 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1835 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 2058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:11,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 817 Invalid, 2058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1835 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 02:53:11,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-10-11 02:53:11,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 346. [2024-10-11 02:53:11,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 266 states have internal predecessors, (408), 60 states have call successors, (60), 22 states have call predecessors, (60), 24 states have return successors, (65), 59 states have call predecessors, (65), 59 states have call successors, (65) [2024-10-11 02:53:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 533 transitions. [2024-10-11 02:53:11,900 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 533 transitions. Word has length 120 [2024-10-11 02:53:11,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:11,901 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 533 transitions. [2024-10-11 02:53:11,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 02:53:11,902 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 533 transitions. [2024-10-11 02:53:11,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 02:53:11,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:11,905 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:11,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:53:11,906 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:11,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:11,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1508593135, now seen corresponding path program 2 times [2024-10-11 02:53:11,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:11,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019593983] [2024-10-11 02:53:11,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:11,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:53:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:53:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:53:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:53:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:53:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:53:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:53:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:53:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:53:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:53:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 02:53:12,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:12,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019593983] [2024-10-11 02:53:12,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019593983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:12,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:12,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:53:12,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268994443] [2024-10-11 02:53:12,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:12,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:53:12,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:12,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:53:12,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:53:12,133 INFO L87 Difference]: Start difference. First operand 346 states and 533 transitions. Second operand has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 02:53:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:13,508 INFO L93 Difference]: Finished difference Result 734 states and 1140 transitions. [2024-10-11 02:53:13,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:53:13,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 121 [2024-10-11 02:53:13,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:13,512 INFO L225 Difference]: With dead ends: 734 [2024-10-11 02:53:13,512 INFO L226 Difference]: Without dead ends: 407 [2024-10-11 02:53:13,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:53:13,514 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 741 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1806 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 2031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:13,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 817 Invalid, 2031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1806 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:53:13,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-11 02:53:13,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 348. [2024-10-11 02:53:13,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 262 states have (on average 1.5610687022900764) internal successors, (409), 268 states have internal predecessors, (409), 60 states have call successors, (60), 22 states have call predecessors, (60), 25 states have return successors, (67), 59 states have call predecessors, (67), 59 states have call successors, (67) [2024-10-11 02:53:13,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 536 transitions. [2024-10-11 02:53:13,545 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 536 transitions. Word has length 121 [2024-10-11 02:53:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:13,545 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 536 transitions. [2024-10-11 02:53:13,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.285714285714286) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 02:53:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 536 transitions. [2024-10-11 02:53:13,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 02:53:13,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:13,548 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:13,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:53:13,548 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:13,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:13,549 INFO L85 PathProgramCache]: Analyzing trace with hash 918206213, now seen corresponding path program 1 times [2024-10-11 02:53:13,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:13,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774290952] [2024-10-11 02:53:13,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:13,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:13,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:13,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:13,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:13,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:13,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:13,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:13,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:53:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:13,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:53:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:13,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:53:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:13,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:53:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:13,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:53:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:13,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:53:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:13,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:53:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:13,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:53:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:13,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:53:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 02:53:13,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:13,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774290952] [2024-10-11 02:53:13,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774290952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:13,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:13,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 02:53:13,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667573227] [2024-10-11 02:53:13,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:13,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:53:13,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:13,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:53:13,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:53:13,796 INFO L87 Difference]: Start difference. First operand 348 states and 536 transitions. Second operand has 11 states, 10 states have (on average 7.6) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-11 02:53:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:15,522 INFO L93 Difference]: Finished difference Result 732 states and 1135 transitions. [2024-10-11 02:53:15,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:53:15,523 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.6) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 122 [2024-10-11 02:53:15,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:15,527 INFO L225 Difference]: With dead ends: 732 [2024-10-11 02:53:15,528 INFO L226 Difference]: Without dead ends: 407 [2024-10-11 02:53:15,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-11 02:53:15,530 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 762 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2924 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 3176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 2924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:15,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 1174 Invalid, 3176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 2924 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 02:53:15,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-11 02:53:15,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 348. [2024-10-11 02:53:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 262 states have (on average 1.5610687022900764) internal successors, (409), 268 states have internal predecessors, (409), 60 states have call successors, (60), 22 states have call predecessors, (60), 25 states have return successors, (66), 59 states have call predecessors, (66), 59 states have call successors, (66) [2024-10-11 02:53:15,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 535 transitions. [2024-10-11 02:53:15,562 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 535 transitions. Word has length 122 [2024-10-11 02:53:15,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:15,563 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 535 transitions. [2024-10-11 02:53:15,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.6) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-11 02:53:15,563 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 535 transitions. [2024-10-11 02:53:15,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 02:53:15,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:15,565 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:15,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:53:15,566 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:15,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:15,566 INFO L85 PathProgramCache]: Analyzing trace with hash -384545872, now seen corresponding path program 2 times [2024-10-11 02:53:15,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:15,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264149639] [2024-10-11 02:53:15,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:15,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:53:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:53:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:53:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:53:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:53:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:53:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:53:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:53:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:53:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:15,806 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 02:53:15,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:15,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264149639] [2024-10-11 02:53:15,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264149639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:15,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:15,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 02:53:15,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533909983] [2024-10-11 02:53:15,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:15,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:53:15,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:15,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:53:15,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:53:15,808 INFO L87 Difference]: Start difference. First operand 348 states and 535 transitions. Second operand has 11 states, 10 states have (on average 7.7) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-11 02:53:17,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:17,729 INFO L93 Difference]: Finished difference Result 734 states and 1141 transitions. [2024-10-11 02:53:17,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:53:17,730 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.7) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 123 [2024-10-11 02:53:17,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:17,733 INFO L225 Difference]: With dead ends: 734 [2024-10-11 02:53:17,733 INFO L226 Difference]: Without dead ends: 409 [2024-10-11 02:53:17,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-11 02:53:17,739 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 735 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 3098 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 3329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 3098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:17,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 1174 Invalid, 3329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 3098 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 02:53:17,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-10-11 02:53:17,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 350. [2024-10-11 02:53:17,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 263 states have (on average 1.55893536121673) internal successors, (410), 270 states have internal predecessors, (410), 60 states have call successors, (60), 22 states have call predecessors, (60), 26 states have return successors, (71), 59 states have call predecessors, (71), 59 states have call successors, (71) [2024-10-11 02:53:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 541 transitions. [2024-10-11 02:53:17,773 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 541 transitions. Word has length 123 [2024-10-11 02:53:17,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:17,773 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 541 transitions. [2024-10-11 02:53:17,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.7) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-11 02:53:17,774 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 541 transitions. [2024-10-11 02:53:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 02:53:17,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:17,776 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:17,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:53:17,776 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:17,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:17,777 INFO L85 PathProgramCache]: Analyzing trace with hash 2045305086, now seen corresponding path program 1 times [2024-10-11 02:53:17,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:17,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641134616] [2024-10-11 02:53:17,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:17,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:17,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:17,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:17,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:17,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:17,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:17,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:17,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:53:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:17,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:53:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:17,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:53:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:17,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:53:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:17,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:53:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:17,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:53:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:17,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:53:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:17,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:53:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:17,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:53:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-11 02:53:17,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:17,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641134616] [2024-10-11 02:53:17,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641134616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:17,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:17,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:53:17,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451268449] [2024-10-11 02:53:17,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:17,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:53:17,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:17,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:53:17,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:53:17,954 INFO L87 Difference]: Start difference. First operand 350 states and 541 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 02:53:19,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:19,217 INFO L93 Difference]: Finished difference Result 736 states and 1144 transitions. [2024-10-11 02:53:19,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:53:19,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 124 [2024-10-11 02:53:19,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:19,223 INFO L225 Difference]: With dead ends: 736 [2024-10-11 02:53:19,223 INFO L226 Difference]: Without dead ends: 409 [2024-10-11 02:53:19,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:53:19,228 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 752 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 1754 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:19,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 809 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1754 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 02:53:19,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-10-11 02:53:19,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 350. [2024-10-11 02:53:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 263 states have (on average 1.55893536121673) internal successors, (410), 270 states have internal predecessors, (410), 60 states have call successors, (60), 22 states have call predecessors, (60), 26 states have return successors, (71), 59 states have call predecessors, (71), 59 states have call successors, (71) [2024-10-11 02:53:19,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 541 transitions. [2024-10-11 02:53:19,259 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 541 transitions. Word has length 124 [2024-10-11 02:53:19,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:19,264 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 541 transitions. [2024-10-11 02:53:19,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-11 02:53:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 541 transitions. [2024-10-11 02:53:19,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 02:53:19,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:19,266 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:19,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:53:19,267 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:19,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:19,268 INFO L85 PathProgramCache]: Analyzing trace with hash -370531264, now seen corresponding path program 1 times [2024-10-11 02:53:19,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:19,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512440563] [2024-10-11 02:53:19,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:19,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:19,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:19,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:19,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:19,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:19,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:19,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:19,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:53:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:19,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:53:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:19,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:53:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:19,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:53:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:19,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:53:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:19,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:53:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:19,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:53:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:19,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:53:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:19,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:53:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:19,421 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 02:53:19,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:19,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512440563] [2024-10-11 02:53:19,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512440563] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:53:19,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629556313] [2024-10-11 02:53:19,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:19,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:53:19,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:53:19,424 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:53:19,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 02:53:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:19,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:53:19,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:53:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 02:53:19,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:53:19,834 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 02:53:19,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629556313] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:53:19,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:53:19,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-10-11 02:53:19,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995665836] [2024-10-11 02:53:19,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:53:19,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:53:19,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:19,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:53:19,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:53:19,836 INFO L87 Difference]: Start difference. First operand 350 states and 541 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 7 states have internal predecessors, (108), 2 states have call successors, (34), 5 states have call predecessors, (34), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 02:53:21,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:21,080 INFO L93 Difference]: Finished difference Result 875 states and 1425 transitions. [2024-10-11 02:53:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:53:21,082 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 7 states have internal predecessors, (108), 2 states have call successors, (34), 5 states have call predecessors, (34), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 124 [2024-10-11 02:53:21,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:21,087 INFO L225 Difference]: With dead ends: 875 [2024-10-11 02:53:21,088 INFO L226 Difference]: Without dead ends: 719 [2024-10-11 02:53:21,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:53:21,090 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 1154 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 1585 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1199 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 1585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:21,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1199 Valid, 1179 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 1585 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 02:53:21,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-10-11 02:53:21,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 645. [2024-10-11 02:53:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 494 states have (on average 1.6194331983805668) internal successors, (800), 501 states have internal predecessors, (800), 124 states have call successors, (124), 22 states have call predecessors, (124), 26 states have return successors, (145), 123 states have call predecessors, (145), 123 states have call successors, (145) [2024-10-11 02:53:21,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1069 transitions. [2024-10-11 02:53:21,136 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1069 transitions. Word has length 124 [2024-10-11 02:53:21,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:21,137 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 1069 transitions. [2024-10-11 02:53:21,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 7 states have internal predecessors, (108), 2 states have call successors, (34), 5 states have call predecessors, (34), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 02:53:21,138 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1069 transitions. [2024-10-11 02:53:21,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 02:53:21,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:21,147 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:21,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 02:53:21,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 02:53:21,349 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:21,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:21,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1737470013, now seen corresponding path program 1 times [2024-10-11 02:53:21,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:21,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087295223] [2024-10-11 02:53:21,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:21,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:21,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:21,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:21,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:21,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:21,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:21,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:21,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:21,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:53:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:21,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:53:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:21,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:53:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:21,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:53:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:21,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:53:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:21,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:53:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:21,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:53:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:21,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 02:53:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:21,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:53:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:21,467 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 02:53:21,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:21,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087295223] [2024-10-11 02:53:21,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087295223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:21,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:21,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:53:21,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636496990] [2024-10-11 02:53:21,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:21,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:53:21,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:21,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:53:21,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:53:21,470 INFO L87 Difference]: Start difference. First operand 645 states and 1069 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:22,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:22,462 INFO L93 Difference]: Finished difference Result 1586 states and 2694 transitions. [2024-10-11 02:53:22,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:53:22,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-10-11 02:53:22,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:22,469 INFO L225 Difference]: With dead ends: 1586 [2024-10-11 02:53:22,469 INFO L226 Difference]: Without dead ends: 1001 [2024-10-11 02:53:22,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:53:22,472 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 831 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:22,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 594 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:53:22,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-10-11 02:53:22,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 937. [2024-10-11 02:53:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 722 states have (on average 1.6301939058171746) internal successors, (1177), 729 states have internal predecessors, (1177), 188 states have call successors, (188), 22 states have call predecessors, (188), 26 states have return successors, (219), 187 states have call predecessors, (219), 187 states have call successors, (219) [2024-10-11 02:53:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1584 transitions. [2024-10-11 02:53:22,522 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1584 transitions. Word has length 130 [2024-10-11 02:53:22,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:22,522 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1584 transitions. [2024-10-11 02:53:22,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:22,523 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1584 transitions. [2024-10-11 02:53:22,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 02:53:22,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:22,529 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:22,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:53:22,529 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:22,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:22,530 INFO L85 PathProgramCache]: Analyzing trace with hash 70227511, now seen corresponding path program 1 times [2024-10-11 02:53:22,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:22,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312544130] [2024-10-11 02:53:22,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:22,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:53:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:53:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:53:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:53:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:53:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:53:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:53:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 02:53:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:53:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:22,632 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 02:53:22,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:22,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312544130] [2024-10-11 02:53:22,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312544130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:22,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:22,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:53:22,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744271393] [2024-10-11 02:53:22,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:22,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:53:22,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:22,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:53:22,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:53:22,635 INFO L87 Difference]: Start difference. First operand 937 states and 1584 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:23,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:23,562 INFO L93 Difference]: Finished difference Result 2283 states and 3921 transitions. [2024-10-11 02:53:23,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:53:23,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-10-11 02:53:23,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:23,573 INFO L225 Difference]: With dead ends: 2283 [2024-10-11 02:53:23,573 INFO L226 Difference]: Without dead ends: 1456 [2024-10-11 02:53:23,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:53:23,577 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 831 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:23,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 576 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 02:53:23,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2024-10-11 02:53:23,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1392. [2024-10-11 02:53:23,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1082 states have (on average 1.6367837338262476) internal successors, (1771), 1089 states have internal predecessors, (1771), 283 states have call successors, (283), 22 states have call predecessors, (283), 26 states have return successors, (314), 282 states have call predecessors, (314), 282 states have call successors, (314) [2024-10-11 02:53:23,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 2368 transitions. [2024-10-11 02:53:23,642 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 2368 transitions. Word has length 131 [2024-10-11 02:53:23,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:23,642 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 2368 transitions. [2024-10-11 02:53:23,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:23,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2368 transitions. [2024-10-11 02:53:23,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 02:53:23,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:23,651 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:23,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:53:23,651 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:23,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:23,652 INFO L85 PathProgramCache]: Analyzing trace with hash -240791263, now seen corresponding path program 1 times [2024-10-11 02:53:23,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:23,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077734036] [2024-10-11 02:53:23,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:23,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:23,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:23,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:23,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:23,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:23,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:23,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:23,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:53:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:23,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:53:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:23,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:53:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:23,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:53:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:23,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:53:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:23,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:53:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:23,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:53:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:23,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 02:53:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:23,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:53:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:23,755 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 02:53:23,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:23,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077734036] [2024-10-11 02:53:23,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077734036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:23,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:23,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:53:23,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860577185] [2024-10-11 02:53:23,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:23,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:53:23,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:23,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:53:23,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:53:23,758 INFO L87 Difference]: Start difference. First operand 1392 states and 2368 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:24,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:24,600 INFO L93 Difference]: Finished difference Result 3301 states and 5733 transitions. [2024-10-11 02:53:24,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:53:24,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2024-10-11 02:53:24,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:24,616 INFO L225 Difference]: With dead ends: 3301 [2024-10-11 02:53:24,616 INFO L226 Difference]: Without dead ends: 2139 [2024-10-11 02:53:24,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:53:24,623 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 839 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:24,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 573 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:53:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2024-10-11 02:53:24,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2075. [2024-10-11 02:53:24,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2075 states, 1642 states have (on average 1.6425091352009744) internal successors, (2697), 1649 states have internal predecessors, (2697), 406 states have call successors, (406), 22 states have call predecessors, (406), 26 states have return successors, (453), 405 states have call predecessors, (453), 405 states have call successors, (453) [2024-10-11 02:53:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 3556 transitions. [2024-10-11 02:53:24,718 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 3556 transitions. Word has length 132 [2024-10-11 02:53:24,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:24,719 INFO L471 AbstractCegarLoop]: Abstraction has 2075 states and 3556 transitions. [2024-10-11 02:53:24,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:24,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 3556 transitions. [2024-10-11 02:53:24,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 02:53:24,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:24,731 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:24,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:53:24,731 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:24,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:24,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1041083190, now seen corresponding path program 1 times [2024-10-11 02:53:24,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:24,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955936079] [2024-10-11 02:53:24,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:24,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:53:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:53:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:53:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:53:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:53:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:53:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 02:53:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 02:53:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:53:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 02:53:24,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:24,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955936079] [2024-10-11 02:53:24,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955936079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:24,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:24,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:53:24,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012442402] [2024-10-11 02:53:24,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:24,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:53:24,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:24,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:53:24,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:53:24,850 INFO L87 Difference]: Start difference. First operand 2075 states and 3556 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:25,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:25,738 INFO L93 Difference]: Finished difference Result 4871 states and 8538 transitions. [2024-10-11 02:53:25,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:53:25,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2024-10-11 02:53:25,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:25,757 INFO L225 Difference]: With dead ends: 4871 [2024-10-11 02:53:25,757 INFO L226 Difference]: Without dead ends: 3223 [2024-10-11 02:53:25,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:53:25,766 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 837 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:25,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 569 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:53:25,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3223 states. [2024-10-11 02:53:25,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3223 to 3159. [2024-10-11 02:53:25,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3159 states, 2547 states have (on average 1.646250490773459) internal successors, (4193), 2554 states have internal predecessors, (4193), 585 states have call successors, (585), 22 states have call predecessors, (585), 26 states have return successors, (658), 584 states have call predecessors, (658), 584 states have call successors, (658) [2024-10-11 02:53:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3159 states to 3159 states and 5436 transitions. [2024-10-11 02:53:25,971 INFO L78 Accepts]: Start accepts. Automaton has 3159 states and 5436 transitions. Word has length 133 [2024-10-11 02:53:25,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:25,971 INFO L471 AbstractCegarLoop]: Abstraction has 3159 states and 5436 transitions. [2024-10-11 02:53:25,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:25,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3159 states and 5436 transitions. [2024-10-11 02:53:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 02:53:25,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:25,987 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:25,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:53:25,988 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:25,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:25,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1049564635, now seen corresponding path program 1 times [2024-10-11 02:53:25,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:25,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280105118] [2024-10-11 02:53:25,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:25,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:26,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:26,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:26,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:26,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:26,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:26,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:26,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:53:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:26,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:53:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:26,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:53:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:26,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:53:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:26,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:53:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:26,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:53:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:26,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:53:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:26,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 02:53:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:26,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:53:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:26,127 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 02:53:26,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:26,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280105118] [2024-10-11 02:53:26,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280105118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:26,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:26,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:53:26,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005685292] [2024-10-11 02:53:26,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:26,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:53:26,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:26,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:53:26,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:53:26,130 INFO L87 Difference]: Start difference. First operand 3159 states and 5436 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:27,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:27,010 INFO L93 Difference]: Finished difference Result 7702 states and 13550 transitions. [2024-10-11 02:53:27,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:53:27,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2024-10-11 02:53:27,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:27,081 INFO L225 Difference]: With dead ends: 7702 [2024-10-11 02:53:27,081 INFO L226 Difference]: Without dead ends: 5193 [2024-10-11 02:53:27,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:53:27,089 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 843 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:27,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 610 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:53:27,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5193 states. [2024-10-11 02:53:27,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5193 to 5129. [2024-10-11 02:53:27,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5129 states, 4141 states have (on average 1.6382516300410528) internal successors, (6784), 4148 states have internal predecessors, (6784), 961 states have call successors, (961), 22 states have call predecessors, (961), 26 states have return successors, (1078), 960 states have call predecessors, (1078), 960 states have call successors, (1078) [2024-10-11 02:53:27,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5129 states to 5129 states and 8823 transitions. [2024-10-11 02:53:27,315 INFO L78 Accepts]: Start accepts. Automaton has 5129 states and 8823 transitions. Word has length 134 [2024-10-11 02:53:27,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:27,316 INFO L471 AbstractCegarLoop]: Abstraction has 5129 states and 8823 transitions. [2024-10-11 02:53:27,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:27,317 INFO L276 IsEmpty]: Start isEmpty. Operand 5129 states and 8823 transitions. [2024-10-11 02:53:27,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 02:53:27,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:27,339 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:27,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:53:27,340 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:27,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:27,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1260431822, now seen corresponding path program 1 times [2024-10-11 02:53:27,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:27,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951033319] [2024-10-11 02:53:27,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:27,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:27,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:27,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:27,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:27,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:27,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:27,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:27,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:53:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:27,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:53:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:27,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:53:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:27,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:53:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:27,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:53:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:27,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:53:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:27,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 02:53:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:27,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 02:53:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:27,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:53:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 02:53:27,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:27,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951033319] [2024-10-11 02:53:27,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951033319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:27,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:27,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:53:27,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601701655] [2024-10-11 02:53:27,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:27,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:53:27,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:27,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:53:27,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:53:27,444 INFO L87 Difference]: Start difference. First operand 5129 states and 8823 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:28,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:28,580 INFO L93 Difference]: Finished difference Result 12683 states and 22298 transitions. [2024-10-11 02:53:28,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:53:28,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 135 [2024-10-11 02:53:28,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:28,635 INFO L225 Difference]: With dead ends: 12683 [2024-10-11 02:53:28,635 INFO L226 Difference]: Without dead ends: 8570 [2024-10-11 02:53:28,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:53:28,658 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 825 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:28,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 579 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:53:28,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8570 states. [2024-10-11 02:53:29,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8570 to 8506. [2024-10-11 02:53:29,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8506 states, 6912 states have (on average 1.6358506944444444) internal successors, (11307), 6919 states have internal predecessors, (11307), 1567 states have call successors, (1567), 22 states have call predecessors, (1567), 26 states have return successors, (1762), 1566 states have call predecessors, (1762), 1566 states have call successors, (1762) [2024-10-11 02:53:29,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8506 states to 8506 states and 14636 transitions. [2024-10-11 02:53:29,076 INFO L78 Accepts]: Start accepts. Automaton has 8506 states and 14636 transitions. Word has length 135 [2024-10-11 02:53:29,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:29,077 INFO L471 AbstractCegarLoop]: Abstraction has 8506 states and 14636 transitions. [2024-10-11 02:53:29,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:29,080 INFO L276 IsEmpty]: Start isEmpty. Operand 8506 states and 14636 transitions. [2024-10-11 02:53:29,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 02:53:29,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:29,172 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:29,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 02:53:29,172 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:29,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:29,173 INFO L85 PathProgramCache]: Analyzing trace with hash 354631075, now seen corresponding path program 1 times [2024-10-11 02:53:29,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:29,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557362047] [2024-10-11 02:53:29,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:29,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:29,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:29,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:29,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:29,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:29,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:29,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:29,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:53:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:29,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:53:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:29,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:53:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:29,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:53:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:29,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:53:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:29,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:53:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:29,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 02:53:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:29,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 02:53:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:29,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:53:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 02:53:29,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557362047] [2024-10-11 02:53:29,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557362047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:29,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:29,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:53:29,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590474575] [2024-10-11 02:53:29,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:29,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:53:29,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:29,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:53:29,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:53:29,308 INFO L87 Difference]: Start difference. First operand 8506 states and 14636 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:30,431 INFO L93 Difference]: Finished difference Result 22035 states and 38697 transitions. [2024-10-11 02:53:30,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:53:30,432 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2024-10-11 02:53:30,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:30,488 INFO L225 Difference]: With dead ends: 22035 [2024-10-11 02:53:30,489 INFO L226 Difference]: Without dead ends: 14954 [2024-10-11 02:53:30,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:53:30,516 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 813 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:30,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 598 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 02:53:30,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14954 states. [2024-10-11 02:53:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14954 to 14890. [2024-10-11 02:53:31,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14890 states, 12093 states have (on average 1.626064665508972) internal successors, (19664), 12100 states have internal predecessors, (19664), 2770 states have call successors, (2770), 22 states have call predecessors, (2770), 26 states have return successors, (3109), 2769 states have call predecessors, (3109), 2769 states have call successors, (3109) [2024-10-11 02:53:31,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14890 states to 14890 states and 25543 transitions. [2024-10-11 02:53:31,141 INFO L78 Accepts]: Start accepts. Automaton has 14890 states and 25543 transitions. Word has length 136 [2024-10-11 02:53:31,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:31,142 INFO L471 AbstractCegarLoop]: Abstraction has 14890 states and 25543 transitions. [2024-10-11 02:53:31,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:31,143 INFO L276 IsEmpty]: Start isEmpty. Operand 14890 states and 25543 transitions. [2024-10-11 02:53:31,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 02:53:31,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:31,185 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:31,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 02:53:31,186 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:31,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:31,186 INFO L85 PathProgramCache]: Analyzing trace with hash 264942481, now seen corresponding path program 1 times [2024-10-11 02:53:31,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:31,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287081099] [2024-10-11 02:53:31,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:31,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:31,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:31,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:31,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:31,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:31,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:31,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:31,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:53:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:31,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:53:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:31,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:53:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:31,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:53:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:31,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:53:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:31,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:53:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:31,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:53:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:31,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 02:53:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:31,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:53:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:31,298 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 02:53:31,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:31,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287081099] [2024-10-11 02:53:31,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287081099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:31,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:31,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:53:31,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741530911] [2024-10-11 02:53:31,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:31,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:53:31,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:31,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:53:31,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:53:31,301 INFO L87 Difference]: Start difference. First operand 14890 states and 25543 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:32,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:32,865 INFO L93 Difference]: Finished difference Result 39394 states and 69083 transitions. [2024-10-11 02:53:32,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:53:32,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2024-10-11 02:53:32,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:33,000 INFO L225 Difference]: With dead ends: 39394 [2024-10-11 02:53:33,001 INFO L226 Difference]: Without dead ends: 26521 [2024-10-11 02:53:33,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:53:33,058 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 841 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:33,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 570 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 02:53:33,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26521 states. [2024-10-11 02:53:34,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26521 to 26457. [2024-10-11 02:53:34,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26457 states, 21621 states have (on average 1.6219878821516118) internal successors, (35069), 21628 states have internal predecessors, (35069), 4809 states have call successors, (4809), 22 states have call predecessors, (4809), 26 states have return successors, (5422), 4808 states have call predecessors, (5422), 4808 states have call successors, (5422) [2024-10-11 02:53:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26457 states to 26457 states and 45300 transitions. [2024-10-11 02:53:34,323 INFO L78 Accepts]: Start accepts. Automaton has 26457 states and 45300 transitions. Word has length 137 [2024-10-11 02:53:34,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:34,325 INFO L471 AbstractCegarLoop]: Abstraction has 26457 states and 45300 transitions. [2024-10-11 02:53:34,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:34,326 INFO L276 IsEmpty]: Start isEmpty. Operand 26457 states and 45300 transitions. [2024-10-11 02:53:34,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 02:53:34,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:34,373 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:34,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 02:53:34,374 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:34,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:34,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1541559103, now seen corresponding path program 1 times [2024-10-11 02:53:34,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:34,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408970553] [2024-10-11 02:53:34,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:34,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:34,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:34,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:34,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:34,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:34,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:34,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:34,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:53:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:34,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:53:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:34,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:53:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:34,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:53:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:34,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:53:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:34,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:53:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:34,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 02:53:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:34,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 02:53:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:34,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:53:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:34,501 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 02:53:34,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:34,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408970553] [2024-10-11 02:53:34,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408970553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:34,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:34,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:53:34,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522378170] [2024-10-11 02:53:34,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:34,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:53:34,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:34,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:53:34,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:53:34,503 INFO L87 Difference]: Start difference. First operand 26457 states and 45300 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:36,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:36,378 INFO L93 Difference]: Finished difference Result 72006 states and 125507 transitions. [2024-10-11 02:53:36,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:53:36,379 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2024-10-11 02:53:36,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:36,639 INFO L225 Difference]: With dead ends: 72006 [2024-10-11 02:53:36,639 INFO L226 Difference]: Without dead ends: 48281 [2024-10-11 02:53:36,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:53:36,740 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 815 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:36,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 580 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:53:36,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48281 states. [2024-10-11 02:53:38,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48281 to 48217. [2024-10-11 02:53:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48217 states, 39666 states have (on average 1.6165229667725507) internal successors, (64121), 39673 states have internal predecessors, (64121), 8524 states have call successors, (8524), 22 states have call predecessors, (8524), 26 states have return successors, (9669), 8523 states have call predecessors, (9669), 8523 states have call successors, (9669) [2024-10-11 02:53:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48217 states to 48217 states and 82314 transitions. [2024-10-11 02:53:39,001 INFO L78 Accepts]: Start accepts. Automaton has 48217 states and 82314 transitions. Word has length 138 [2024-10-11 02:53:39,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:39,002 INFO L471 AbstractCegarLoop]: Abstraction has 48217 states and 82314 transitions. [2024-10-11 02:53:39,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:39,002 INFO L276 IsEmpty]: Start isEmpty. Operand 48217 states and 82314 transitions. [2024-10-11 02:53:39,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 02:53:39,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:39,394 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:39,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 02:53:39,394 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:39,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:39,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1233248049, now seen corresponding path program 1 times [2024-10-11 02:53:39,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:39,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785419401] [2024-10-11 02:53:39,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:39,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:39,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:39,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:39,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:39,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:39,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:39,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:39,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:53:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:39,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:53:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:39,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:53:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:39,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:53:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:39,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:53:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:39,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 02:53:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:39,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 02:53:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:39,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 02:53:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:39,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:53:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 02:53:39,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:39,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785419401] [2024-10-11 02:53:39,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785419401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:53:39,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:53:39,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:53:39,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389826860] [2024-10-11 02:53:39,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:53:39,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:53:39,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:39,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:53:39,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:53:39,529 INFO L87 Difference]: Start difference. First operand 48217 states and 82314 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:42,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:53:42,403 INFO L93 Difference]: Finished difference Result 89725 states and 156871 transitions. [2024-10-11 02:53:42,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:53:42,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2024-10-11 02:53:42,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:53:42,837 INFO L225 Difference]: With dead ends: 89725 [2024-10-11 02:53:42,837 INFO L226 Difference]: Without dead ends: 89569 [2024-10-11 02:53:42,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:53:42,888 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 832 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:53:42,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 578 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 02:53:42,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89569 states. [2024-10-11 02:53:45,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89569 to 89505. [2024-10-11 02:53:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89505 states, 74155 states have (on average 1.609480142943834) internal successors, (119351), 74162 states have internal predecessors, (119351), 15323 states have call successors, (15323), 22 states have call predecessors, (15323), 26 states have return successors, (17514), 15322 states have call predecessors, (17514), 15322 states have call successors, (17514) [2024-10-11 02:53:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89505 states to 89505 states and 152188 transitions. [2024-10-11 02:53:47,091 INFO L78 Accepts]: Start accepts. Automaton has 89505 states and 152188 transitions. Word has length 139 [2024-10-11 02:53:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:53:47,091 INFO L471 AbstractCegarLoop]: Abstraction has 89505 states and 152188 transitions. [2024-10-11 02:53:47,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 02:53:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 89505 states and 152188 transitions. [2024-10-11 02:53:47,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 02:53:47,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:53:47,177 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:53:47,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 02:53:47,177 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:53:47,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:53:47,178 INFO L85 PathProgramCache]: Analyzing trace with hash -317527070, now seen corresponding path program 1 times [2024-10-11 02:53:47,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:53:47,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779467695] [2024-10-11 02:53:47,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:47,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:53:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:47,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:53:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:47,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:53:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:47,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:53:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:47,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:53:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:47,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:53:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:47,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:53:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:47,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:53:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:47,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:53:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:47,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:53:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:47,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:53:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:47,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:53:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:47,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:53:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:47,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 02:53:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:47,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 02:53:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:47,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:53:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:47,741 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 02:53:47,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:53:47,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779467695] [2024-10-11 02:53:47,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779467695] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:53:47,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787317883] [2024-10-11 02:53:47,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:53:47,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:53:47,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:53:47,746 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:53:47,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 02:53:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:53:48,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 02:53:48,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:53:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 02:53:48,232 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:53:48,535 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:53:48,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787317883] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:53:48,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:53:48,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 30 [2024-10-11 02:53:48,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100735364] [2024-10-11 02:53:48,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:53:48,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 02:53:48,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:53:48,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 02:53:48,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2024-10-11 02:53:48,538 INFO L87 Difference]: Start difference. First operand 89505 states and 152188 transitions. Second operand has 30 states, 29 states have (on average 7.862068965517241) internal successors, (228), 23 states have internal predecessors, (228), 9 states have call successors, (45), 11 states have call predecessors, (45), 11 states have return successors, (39), 11 states have call predecessors, (39), 9 states have call successors, (39) [2024-10-11 02:54:08,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:54:08,038 INFO L93 Difference]: Finished difference Result 357339 states and 640191 transitions. [2024-10-11 02:54:08,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-10-11 02:54:08,039 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 7.862068965517241) internal successors, (228), 23 states have internal predecessors, (228), 9 states have call successors, (45), 11 states have call predecessors, (45), 11 states have return successors, (39), 11 states have call predecessors, (39), 9 states have call successors, (39) Word has length 140 [2024-10-11 02:54:08,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:54:10,901 INFO L225 Difference]: With dead ends: 357339 [2024-10-11 02:54:10,902 INFO L226 Difference]: Without dead ends: 357188 [2024-10-11 02:54:11,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5444 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2421, Invalid=14609, Unknown=0, NotChecked=0, Total=17030 [2024-10-11 02:54:11,057 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 4331 mSDsluCounter, 6563 mSDsCounter, 0 mSdLazyCounter, 18899 mSolverCounterSat, 1400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4355 SdHoareTripleChecker+Valid, 6941 SdHoareTripleChecker+Invalid, 20299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1400 IncrementalHoareTripleChecker+Valid, 18899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:54:11,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4355 Valid, 6941 Invalid, 20299 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1400 Valid, 18899 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2024-10-11 02:54:11,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357188 states.