./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_spec1_product15.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product15.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 68503ade3bb1f8128c7da84cd7c3e560bf5cd62b2b0df855f3aa4d33b9063aa0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 00:45:43,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 00:45:43,100 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 00:45:43,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 00:45:43,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 00:45:43,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 00:45:43,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 00:45:43,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 00:45:43,144 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 00:45:43,145 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 00:45:43,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 00:45:43,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 00:45:43,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 00:45:43,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 00:45:43,149 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 00:45:43,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 00:45:43,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 00:45:43,150 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 00:45:43,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 00:45:43,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 00:45:43,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 00:45:43,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 00:45:43,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 00:45:43,154 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 00:45:43,154 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 00:45:43,155 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 00:45:43,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 00:45:43,155 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 00:45:43,155 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 00:45:43,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 00:45:43,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 00:45:43,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 00:45:43,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:45:43,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 00:45:43,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 00:45:43,157 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 00:45:43,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 00:45:43,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 00:45:43,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 00:45:43,159 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 00:45:43,159 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 00:45:43,160 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 00:45:43,160 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/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/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 -> 68503ade3bb1f8128c7da84cd7c3e560bf5cd62b2b0df855f3aa4d33b9063aa0 [2024-10-24 00:45:43,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 00:45:43,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 00:45:43,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 00:45:43,454 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 00:45:43,455 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 00:45:43,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product15.cil.c [2024-10-24 00:45:44,849 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 00:45:45,165 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 00:45:45,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product15.cil.c [2024-10-24 00:45:45,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b57f5c051/7b1beb0940714995af9db3d112c4bfb4/FLAG1be5b633b [2024-10-24 00:45:45,428 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b57f5c051/7b1beb0940714995af9db3d112c4bfb4 [2024-10-24 00:45:45,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 00:45:45,433 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 00:45:45,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 00:45:45,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 00:45:45,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 00:45:45,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:45:45" (1/1) ... [2024-10-24 00:45:45,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@433610de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:45, skipping insertion in model container [2024-10-24 00:45:45,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:45:45" (1/1) ... [2024-10-24 00:45:45,500 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 00:45:45,929 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_spec1_product15.cil.c[34816,34829] [2024-10-24 00:45:46,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:45:46,191 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 00:45:46,201 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [48] [2024-10-24 00:45:46,203 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1128] [2024-10-24 00:45:46,203 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1540] [2024-10-24 00:45:46,204 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1549] [2024-10-24 00:45:46,204 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1666] [2024-10-24 00:45:46,204 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1891] [2024-10-24 00:45:46,204 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2176] [2024-10-24 00:45:46,204 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [2542] [2024-10-24 00:45:46,205 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2570] [2024-10-24 00:45:46,205 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2831] [2024-10-24 00:45:46,205 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2848] [2024-10-24 00:45:46,237 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_spec1_product15.cil.c[34816,34829] [2024-10-24 00:45:46,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:45:46,299 INFO L204 MainTranslator]: Completed translation [2024-10-24 00:45:46,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:46 WrapperNode [2024-10-24 00:45:46,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 00:45:46,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 00:45:46,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 00:45:46,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 00:45:46,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:46" (1/1) ... [2024-10-24 00:45:46,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:46" (1/1) ... [2024-10-24 00:45:46,401 INFO L138 Inliner]: procedures = 125, calls = 182, calls flagged for inlining = 54, calls inlined = 45, statements flattened = 878 [2024-10-24 00:45:46,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 00:45:46,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 00:45:46,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 00:45:46,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 00:45:46,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:46" (1/1) ... [2024-10-24 00:45:46,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:46" (1/1) ... [2024-10-24 00:45:46,428 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:46" (1/1) ... [2024-10-24 00:45:46,461 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-24 00:45:46,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:46" (1/1) ... [2024-10-24 00:45:46,462 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:46" (1/1) ... [2024-10-24 00:45:46,481 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:46" (1/1) ... [2024-10-24 00:45:46,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:46" (1/1) ... [2024-10-24 00:45:46,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:46" (1/1) ... [2024-10-24 00:45:46,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:46" (1/1) ... [2024-10-24 00:45:46,503 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 00:45:46,504 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 00:45:46,504 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 00:45:46,504 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 00:45:46,505 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:46" (1/1) ... [2024-10-24 00:45:46,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:45:46,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:45:46,544 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 00:45:46,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 00:45:46,586 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-10-24 00:45:46,586 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-10-24 00:45:46,586 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-10-24 00:45:46,586 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-10-24 00:45:46,586 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-24 00:45:46,587 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-24 00:45:46,587 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-24 00:45:46,588 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-24 00:45:46,588 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-24 00:45:46,588 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-24 00:45:46,588 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-10-24 00:45:46,588 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-10-24 00:45:46,589 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-24 00:45:46,589 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-24 00:45:46,590 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-24 00:45:46,590 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-24 00:45:46,590 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-24 00:45:46,590 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-24 00:45:46,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 00:45:46,591 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-24 00:45:46,591 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-24 00:45:46,591 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-24 00:45:46,591 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-24 00:45:46,591 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-24 00:45:46,591 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-24 00:45:46,591 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-24 00:45:46,591 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-24 00:45:46,591 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-10-24 00:45:46,591 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-10-24 00:45:46,591 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-24 00:45:46,591 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-24 00:45:46,592 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-24 00:45:46,592 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-24 00:45:46,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 00:45:46,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 00:45:46,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 00:45:46,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 00:45:46,592 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-24 00:45:46,592 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-24 00:45:46,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 00:45:46,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 00:45:46,775 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 00:45:46,777 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 00:45:47,549 INFO L? ?]: Removed 373 outVars from TransFormulas that were not future-live. [2024-10-24 00:45:47,549 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 00:45:47,614 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 00:45:47,616 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 00:45:47,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:45:47 BoogieIcfgContainer [2024-10-24 00:45:47,617 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 00:45:47,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 00:45:47,620 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 00:45:47,623 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 00:45:47,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:45:45" (1/3) ... [2024-10-24 00:45:47,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e60504a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:45:47, skipping insertion in model container [2024-10-24 00:45:47,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:45:46" (2/3) ... [2024-10-24 00:45:47,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e60504a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:45:47, skipping insertion in model container [2024-10-24 00:45:47,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:45:47" (3/3) ... [2024-10-24 00:45:47,626 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec1_product15.cil.c [2024-10-24 00:45:47,642 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 00:45:47,643 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 00:45:47,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 00:45:47,725 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;@76bd6a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 00:45:47,725 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 00:45:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 262 states, 201 states have (on average 1.6119402985074627) internal successors, (324), 205 states have internal predecessors, (324), 42 states have call successors, (42), 17 states have call predecessors, (42), 17 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 00:45:47,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 00:45:47,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:45:47,749 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:45:47,750 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:45:47,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:45:47,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1397232782, now seen corresponding path program 1 times [2024-10-24 00:45:47,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:45:47,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413072072] [2024-10-24 00:45:47,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:47,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:45:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:45:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:45:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:45:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:45:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:45:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:45:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 00:45:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 00:45:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:45:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:45:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:45:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,511 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:45:48,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:45:48,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413072072] [2024-10-24 00:45:48,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413072072] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:45:48,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825636010] [2024-10-24 00:45:48,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:48,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:45:48,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:45:48,517 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:45:48,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 00:45:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:48,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 00:45:48,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:45:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:45:48,849 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:45:48,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825636010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:45:48,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:45:48,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-24 00:45:48,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056418174] [2024-10-24 00:45:48,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:45:48,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 00:45:48,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:45:48,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 00:45:48,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:45:48,892 INFO L87 Difference]: Start difference. First operand has 262 states, 201 states have (on average 1.6119402985074627) internal successors, (324), 205 states have internal predecessors, (324), 42 states have call successors, (42), 17 states have call predecessors, (42), 17 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:45:48,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:45:48,976 INFO L93 Difference]: Finished difference Result 379 states and 579 transitions. [2024-10-24 00:45:48,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 00:45:48,981 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 83 [2024-10-24 00:45:48,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:45:48,992 INFO L225 Difference]: With dead ends: 379 [2024-10-24 00:45:48,993 INFO L226 Difference]: Without dead ends: 259 [2024-10-24 00:45:48,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 101 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-24 00:45:49,003 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:45:49,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:45:49,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-24 00:45:49,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2024-10-24 00:45:49,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 199 states have (on average 1.592964824120603) internal successors, (317), 202 states have internal predecessors, (317), 42 states have call successors, (42), 17 states have call predecessors, (42), 17 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 00:45:49,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 400 transitions. [2024-10-24 00:45:49,072 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 400 transitions. Word has length 83 [2024-10-24 00:45:49,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:45:49,075 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 400 transitions. [2024-10-24 00:45:49,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:45:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 400 transitions. [2024-10-24 00:45:49,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 00:45:49,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:45:49,083 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:45:49,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 00:45:49,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-24 00:45:49,285 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:45:49,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:45:49,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2089638371, now seen corresponding path program 1 times [2024-10-24 00:45:49,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:45:49,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765867003] [2024-10-24 00:45:49,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:49,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:45:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:49,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:45:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:49,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:45:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:49,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:45:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:49,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:45:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:49,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:45:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:49,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:45:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:49,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:45:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:49,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 00:45:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:49,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:45:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:49,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:45:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:49,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:45:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:49,637 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:45:49,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:45:49,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765867003] [2024-10-24 00:45:49,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765867003] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:45:49,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79150603] [2024-10-24 00:45:49,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:49,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:45:49,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:45:49,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:45:49,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 00:45:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:49,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 00:45:49,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:45:49,946 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:45:49,949 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:45:49,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79150603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:45:49,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:45:49,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 00:45:49,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235205227] [2024-10-24 00:45:49,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:45:49,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:45:49,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:45:49,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:45:49,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:45:49,952 INFO L87 Difference]: Start difference. First operand 259 states and 400 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:45:50,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:45:50,001 INFO L93 Difference]: Finished difference Result 375 states and 566 transitions. [2024-10-24 00:45:50,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:45:50,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 84 [2024-10-24 00:45:50,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:45:50,008 INFO L225 Difference]: With dead ends: 375 [2024-10-24 00:45:50,008 INFO L226 Difference]: Without dead ends: 261 [2024-10-24 00:45:50,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:45:50,010 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 0 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:45:50,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 777 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:45:50,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-24 00:45:50,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2024-10-24 00:45:50,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 201 states have (on average 1.5870646766169154) internal successors, (319), 204 states have internal predecessors, (319), 42 states have call successors, (42), 17 states have call predecessors, (42), 17 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 00:45:50,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 402 transitions. [2024-10-24 00:45:50,045 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 402 transitions. Word has length 84 [2024-10-24 00:45:50,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:45:50,046 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 402 transitions. [2024-10-24 00:45:50,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:45:50,046 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 402 transitions. [2024-10-24 00:45:50,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 00:45:50,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:45:50,050 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:45:50,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 00:45:50,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-24 00:45:50,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:45:50,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:45:50,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1406376176, now seen corresponding path program 1 times [2024-10-24 00:45:50,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:45:50,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862775238] [2024-10-24 00:45:50,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:50,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:45:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:50,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:45:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:50,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:45:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:50,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:45:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:50,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:45:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:50,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:45:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:50,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:45:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:50,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 00:45:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:50,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:45:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:50,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:45:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:50,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:45:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:50,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:45:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:50,524 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:45:50,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:45:50,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862775238] [2024-10-24 00:45:50,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862775238] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:45:50,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942157195] [2024-10-24 00:45:50,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:50,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:45:50,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:45:50,527 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:45:50,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 00:45:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:50,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:45:50,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:45:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:45:50,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:45:50,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942157195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:45:50,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:45:50,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 00:45:50,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440878076] [2024-10-24 00:45:50,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:45:50,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:45:50,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:45:50,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:45:50,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:45:50,803 INFO L87 Difference]: Start difference. First operand 261 states and 402 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:45:50,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:45:50,882 INFO L93 Difference]: Finished difference Result 552 states and 863 transitions. [2024-10-24 00:45:50,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:45:50,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 91 [2024-10-24 00:45:50,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:45:50,890 INFO L225 Difference]: With dead ends: 552 [2024-10-24 00:45:50,890 INFO L226 Difference]: Without dead ends: 313 [2024-10-24 00:45:50,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:45:50,896 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 102 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:45:50,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 743 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:45:50,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-24 00:45:50,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 308. [2024-10-24 00:45:50,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 237 states have (on average 1.59915611814346) internal successors, (379), 240 states have internal predecessors, (379), 53 states have call successors, (53), 17 states have call predecessors, (53), 17 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 00:45:50,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 484 transitions. [2024-10-24 00:45:50,915 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 484 transitions. Word has length 91 [2024-10-24 00:45:50,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:45:50,916 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 484 transitions. [2024-10-24 00:45:50,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:45:50,916 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 484 transitions. [2024-10-24 00:45:50,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 00:45:50,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:45:50,919 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:45:50,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 00:45:51,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:45:51,120 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:45:51,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:45:51,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1819701507, now seen corresponding path program 1 times [2024-10-24 00:45:51,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:45:51,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092974498] [2024-10-24 00:45:51,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:51,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:45:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:45:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:45:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:45:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:45:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:45:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:45:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 00:45:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:45:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:45:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:45:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:45:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:45:51,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:45:51,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092974498] [2024-10-24 00:45:51,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092974498] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:45:51,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133834557] [2024-10-24 00:45:51,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:51,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:45:51,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:45:51,369 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:45:51,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 00:45:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:51,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 926 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 00:45:51,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:45:51,730 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 00:45:51,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:45:51,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133834557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:45:51,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:45:51,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-24 00:45:51,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314436423] [2024-10-24 00:45:51,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:45:51,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:45:51,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:45:51,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:45:51,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:45:51,733 INFO L87 Difference]: Start difference. First operand 308 states and 484 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:45:51,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:45:51,826 INFO L93 Difference]: Finished difference Result 611 states and 962 transitions. [2024-10-24 00:45:51,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:45:51,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 92 [2024-10-24 00:45:51,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:45:51,831 INFO L225 Difference]: With dead ends: 611 [2024-10-24 00:45:51,831 INFO L226 Difference]: Without dead ends: 310 [2024-10-24 00:45:51,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:45:51,836 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 2 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:45:51,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1513 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:45:51,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-10-24 00:45:51,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2024-10-24 00:45:51,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 238 states have (on average 1.596638655462185) internal successors, (380), 242 states have internal predecessors, (380), 53 states have call successors, (53), 17 states have call predecessors, (53), 18 states have return successors, (54), 52 states have call predecessors, (54), 52 states have call successors, (54) [2024-10-24 00:45:51,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 487 transitions. [2024-10-24 00:45:51,862 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 487 transitions. Word has length 92 [2024-10-24 00:45:51,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:45:51,863 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 487 transitions. [2024-10-24 00:45:51,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:45:51,863 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 487 transitions. [2024-10-24 00:45:51,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 00:45:51,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:45:51,868 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:45:51,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 00:45:52,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:45:52,073 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:45:52,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:45:52,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1559557357, now seen corresponding path program 1 times [2024-10-24 00:45:52,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:45:52,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243351031] [2024-10-24 00:45:52,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:52,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:45:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:52,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:45:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:52,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:45:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:52,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:45:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:52,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:45:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:52,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 00:45:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:52,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 00:45:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:52,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 00:45:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:52,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 00:45:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:52,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:45:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:52,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:45:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:52,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:45:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:45:52,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:45:52,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243351031] [2024-10-24 00:45:52,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243351031] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:45:52,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14464787] [2024-10-24 00:45:52,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:52,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:45:52,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:45:52,306 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:45:52,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 00:45:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:52,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 00:45:52,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:45:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 00:45:52,656 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:45:52,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14464787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:45:52,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:45:52,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-24 00:45:52,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308960861] [2024-10-24 00:45:52,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:45:52,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:45:52,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:45:52,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:45:52,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:45:52,659 INFO L87 Difference]: Start difference. First operand 310 states and 487 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:45:52,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:45:52,757 INFO L93 Difference]: Finished difference Result 613 states and 967 transitions. [2024-10-24 00:45:52,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:45:52,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 93 [2024-10-24 00:45:52,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:45:52,761 INFO L225 Difference]: With dead ends: 613 [2024-10-24 00:45:52,761 INFO L226 Difference]: Without dead ends: 312 [2024-10-24 00:45:52,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:45:52,763 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 2 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:45:52,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1499 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:45:52,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-24 00:45:52,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2024-10-24 00:45:52,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 239 states have (on average 1.594142259414226) internal successors, (381), 244 states have internal predecessors, (381), 53 states have call successors, (53), 17 states have call predecessors, (53), 19 states have return successors, (59), 52 states have call predecessors, (59), 52 states have call successors, (59) [2024-10-24 00:45:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 493 transitions. [2024-10-24 00:45:52,780 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 493 transitions. Word has length 93 [2024-10-24 00:45:52,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:45:52,780 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 493 transitions. [2024-10-24 00:45:52,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:45:52,781 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 493 transitions. [2024-10-24 00:45:52,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 00:45:52,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:45:52,783 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:45:52,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-24 00:45:52,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:45:52,988 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:45:52,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:45:52,988 INFO L85 PathProgramCache]: Analyzing trace with hash -699654245, now seen corresponding path program 1 times [2024-10-24 00:45:52,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:45:52,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635538915] [2024-10-24 00:45:52,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:52,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:45:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:45:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:45:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:45:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:45:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:45:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 00:45:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:45:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 00:45:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:45:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:45:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:45:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:45:53,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:45:53,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635538915] [2024-10-24 00:45:53,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635538915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:45:53,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:45:53,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:45:53,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606448708] [2024-10-24 00:45:53,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:45:53,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:45:53,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:45:53,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:45:53,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:45:53,194 INFO L87 Difference]: Start difference. First operand 312 states and 493 transitions. Second operand has 9 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:45:54,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:45:54,765 INFO L93 Difference]: Finished difference Result 674 states and 1076 transitions. [2024-10-24 00:45:54,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:45:54,766 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 94 [2024-10-24 00:45:54,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:45:54,769 INFO L225 Difference]: With dead ends: 674 [2024-10-24 00:45:54,769 INFO L226 Difference]: Without dead ends: 381 [2024-10-24 00:45:54,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:45:54,771 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 810 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:45:54,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 968 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:45:54,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-10-24 00:45:54,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 312. [2024-10-24 00:45:54,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 239 states have (on average 1.594142259414226) internal successors, (381), 244 states have internal predecessors, (381), 53 states have call successors, (53), 17 states have call predecessors, (53), 19 states have return successors, (58), 52 states have call predecessors, (58), 52 states have call successors, (58) [2024-10-24 00:45:54,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 492 transitions. [2024-10-24 00:45:54,800 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 492 transitions. Word has length 94 [2024-10-24 00:45:54,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:45:54,801 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 492 transitions. [2024-10-24 00:45:54,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:45:54,801 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 492 transitions. [2024-10-24 00:45:54,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 00:45:54,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:45:54,803 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:45:54,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 00:45:54,804 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:45:54,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:45:54,804 INFO L85 PathProgramCache]: Analyzing trace with hash 214843501, now seen corresponding path program 2 times [2024-10-24 00:45:54,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:45:54,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862775762] [2024-10-24 00:45:54,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:54,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:45:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:54,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:45:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:54,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:45:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:54,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:45:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:54,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:45:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:54,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:45:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:54,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 00:45:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:45:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 00:45:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:45:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:45:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:45:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:55,043 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:45:55,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:45:55,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862775762] [2024-10-24 00:45:55,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862775762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:45:55,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:45:55,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:45:55,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353416030] [2024-10-24 00:45:55,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:45:55,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:45:55,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:45:55,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:45:55,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:45:55,046 INFO L87 Difference]: Start difference. First operand 312 states and 492 transitions. Second operand has 9 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:45:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:45:56,595 INFO L93 Difference]: Finished difference Result 676 states and 1079 transitions. [2024-10-24 00:45:56,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:45:56,596 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 95 [2024-10-24 00:45:56,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:45:56,598 INFO L225 Difference]: With dead ends: 676 [2024-10-24 00:45:56,599 INFO L226 Difference]: Without dead ends: 383 [2024-10-24 00:45:56,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:45:56,601 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 806 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 1990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:45:56,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 968 Invalid, 1990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1744 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:45:56,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-24 00:45:56,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 314. [2024-10-24 00:45:56,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 240 states have (on average 1.5916666666666666) internal successors, (382), 246 states have internal predecessors, (382), 53 states have call successors, (53), 17 states have call predecessors, (53), 20 states have return successors, (60), 52 states have call predecessors, (60), 52 states have call successors, (60) [2024-10-24 00:45:56,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 495 transitions. [2024-10-24 00:45:56,636 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 495 transitions. Word has length 95 [2024-10-24 00:45:56,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:45:56,637 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 495 transitions. [2024-10-24 00:45:56,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:45:56,637 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 495 transitions. [2024-10-24 00:45:56,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 00:45:56,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:45:56,640 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:45:56,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 00:45:56,640 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:45:56,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:45:56,641 INFO L85 PathProgramCache]: Analyzing trace with hash 511003958, now seen corresponding path program 1 times [2024-10-24 00:45:56,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:45:56,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198241753] [2024-10-24 00:45:56,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:56,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:45:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:56,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:45:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:56,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:45:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:56,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:45:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:56,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:45:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:56,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:45:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:56,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:45:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:56,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:45:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:56,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 00:45:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:56,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:45:56,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:56,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:45:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:56,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:45:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:45:56,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:45:56,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198241753] [2024-10-24 00:45:56,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198241753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:45:56,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:45:56,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:45:56,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092045043] [2024-10-24 00:45:56,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:45:56,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:45:56,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:45:56,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:45:56,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:45:56,874 INFO L87 Difference]: Start difference. First operand 314 states and 495 transitions. Second operand has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 8 states have internal predecessors, (64), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-24 00:45:58,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:45:58,883 INFO L93 Difference]: Finished difference Result 674 states and 1074 transitions. [2024-10-24 00:45:58,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:45:58,884 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 8 states have internal predecessors, (64), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 96 [2024-10-24 00:45:58,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:45:58,887 INFO L225 Difference]: With dead ends: 674 [2024-10-24 00:45:58,887 INFO L226 Difference]: Without dead ends: 383 [2024-10-24 00:45:58,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-24 00:45:58,890 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 810 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 2880 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 3132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 2880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 00:45:58,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 1343 Invalid, 3132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 2880 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 00:45:58,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-24 00:45:58,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 314. [2024-10-24 00:45:58,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 240 states have (on average 1.5916666666666666) internal successors, (382), 246 states have internal predecessors, (382), 53 states have call successors, (53), 17 states have call predecessors, (53), 20 states have return successors, (59), 52 states have call predecessors, (59), 52 states have call successors, (59) [2024-10-24 00:45:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 494 transitions. [2024-10-24 00:45:58,918 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 494 transitions. Word has length 96 [2024-10-24 00:45:58,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:45:58,919 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 494 transitions. [2024-10-24 00:45:58,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 8 states have internal predecessors, (64), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-24 00:45:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 494 transitions. [2024-10-24 00:45:58,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 00:45:58,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:45:58,922 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:45:58,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 00:45:58,922 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:45:58,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:45:58,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1509845100, now seen corresponding path program 2 times [2024-10-24 00:45:58,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:45:58,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009447153] [2024-10-24 00:45:58,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:45:58,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:45:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:45:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:45:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:45:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:45:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:45:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:45:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:45:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:45:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:45:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:45:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:45:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:45:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:45:59,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:45:59,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009447153] [2024-10-24 00:45:59,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009447153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:45:59,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:45:59,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:45:59,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448186107] [2024-10-24 00:45:59,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:45:59,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:45:59,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:45:59,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:45:59,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:45:59,162 INFO L87 Difference]: Start difference. First operand 314 states and 494 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-24 00:46:00,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:00,981 INFO L93 Difference]: Finished difference Result 676 states and 1080 transitions. [2024-10-24 00:46:00,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:46:00,982 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 97 [2024-10-24 00:46:00,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:00,985 INFO L225 Difference]: With dead ends: 676 [2024-10-24 00:46:00,985 INFO L226 Difference]: Without dead ends: 385 [2024-10-24 00:46:00,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-24 00:46:00,987 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 806 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 2923 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 3173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 2923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:00,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1344 Invalid, 3173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 2923 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 00:46:00,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-24 00:46:01,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 316. [2024-10-24 00:46:01,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 241 states have (on average 1.5892116182572613) internal successors, (383), 248 states have internal predecessors, (383), 53 states have call successors, (53), 17 states have call predecessors, (53), 21 states have return successors, (64), 52 states have call predecessors, (64), 52 states have call successors, (64) [2024-10-24 00:46:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 500 transitions. [2024-10-24 00:46:01,011 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 500 transitions. Word has length 97 [2024-10-24 00:46:01,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:01,011 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 500 transitions. [2024-10-24 00:46:01,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-24 00:46:01,012 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 500 transitions. [2024-10-24 00:46:01,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 00:46:01,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:01,014 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:46:01,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 00:46:01,014 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:01,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:01,015 INFO L85 PathProgramCache]: Analyzing trace with hash -794817391, now seen corresponding path program 1 times [2024-10-24 00:46:01,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:01,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696249445] [2024-10-24 00:46:01,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:01,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:01,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:01,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:01,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:01,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:01,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:46:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:01,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:46:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:01,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 00:46:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:01,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:46:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:01,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:46:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:01,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:46:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:01,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:46:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:01,250 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-24 00:46:01,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:01,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696249445] [2024-10-24 00:46:01,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696249445] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:46:01,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397855013] [2024-10-24 00:46:01,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:01,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:46:01,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:46:01,253 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:46:01,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 00:46:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:01,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 932 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:46:01,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:46:01,543 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:46:01,543 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:46:01,643 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:46:01,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397855013] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:46:01,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:46:01,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-10-24 00:46:01,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360273374] [2024-10-24 00:46:01,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:46:01,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 00:46:01,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:01,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 00:46:01,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:46:01,646 INFO L87 Difference]: Start difference. First operand 316 states and 500 transitions. Second operand has 15 states, 14 states have (on average 7.642857142857143) internal successors, (107), 11 states have internal predecessors, (107), 4 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-24 00:46:04,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:04,128 INFO L93 Difference]: Finished difference Result 1005 states and 1691 transitions. [2024-10-24 00:46:04,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 00:46:04,129 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.642857142857143) internal successors, (107), 11 states have internal predecessors, (107), 4 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 98 [2024-10-24 00:46:04,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:04,134 INFO L225 Difference]: With dead ends: 1005 [2024-10-24 00:46:04,135 INFO L226 Difference]: Without dead ends: 715 [2024-10-24 00:46:04,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2024-10-24 00:46:04,139 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 1756 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 3396 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1773 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 3941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 3396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:04,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1773 Valid, 1575 Invalid, 3941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 3396 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 00:46:04,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-10-24 00:46:04,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 631. [2024-10-24 00:46:04,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 492 states have (on average 1.6280487804878048) internal successors, (801), 499 states have internal predecessors, (801), 117 states have call successors, (117), 17 states have call predecessors, (117), 21 states have return successors, (138), 116 states have call predecessors, (138), 116 states have call successors, (138) [2024-10-24 00:46:04,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1056 transitions. [2024-10-24 00:46:04,182 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1056 transitions. Word has length 98 [2024-10-24 00:46:04,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:04,183 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 1056 transitions. [2024-10-24 00:46:04,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.642857142857143) internal successors, (107), 11 states have internal predecessors, (107), 4 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-24 00:46:04,184 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1056 transitions. [2024-10-24 00:46:04,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 00:46:04,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:04,187 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:46:04,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 00:46:04,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:46:04,389 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:04,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:04,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1009479507, now seen corresponding path program 1 times [2024-10-24 00:46:04,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:04,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527144385] [2024-10-24 00:46:04,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:04,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:46:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:46:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:46:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:46:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:46:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:46:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:46:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:46:04,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:04,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527144385] [2024-10-24 00:46:04,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527144385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:04,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:04,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:46:04,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631207093] [2024-10-24 00:46:04,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:04,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:46:04,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:04,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:46:04,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:46:04,549 INFO L87 Difference]: Start difference. First operand 631 states and 1056 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:46:05,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:05,657 INFO L93 Difference]: Finished difference Result 1560 states and 2680 transitions. [2024-10-24 00:46:05,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:46:05,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2024-10-24 00:46:05,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:05,664 INFO L225 Difference]: With dead ends: 1560 [2024-10-24 00:46:05,664 INFO L226 Difference]: Without dead ends: 997 [2024-10-24 00:46:05,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:46:05,668 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 904 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:05,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 729 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:46:05,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2024-10-24 00:46:05,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 923. [2024-10-24 00:46:05,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 720 states have (on average 1.636111111111111) internal successors, (1178), 727 states have internal predecessors, (1178), 181 states have call successors, (181), 17 states have call predecessors, (181), 21 states have return successors, (212), 180 states have call predecessors, (212), 180 states have call successors, (212) [2024-10-24 00:46:05,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1571 transitions. [2024-10-24 00:46:05,717 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1571 transitions. Word has length 102 [2024-10-24 00:46:05,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:05,718 INFO L471 AbstractCegarLoop]: Abstraction has 923 states and 1571 transitions. [2024-10-24 00:46:05,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:46:05,718 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1571 transitions. [2024-10-24 00:46:05,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 00:46:05,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:05,723 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:46:05,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 00:46:05,723 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:05,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:05,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1643890677, now seen corresponding path program 1 times [2024-10-24 00:46:05,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:05,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907507715] [2024-10-24 00:46:05,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:05,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:05,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:05,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:05,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:05,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:05,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:46:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:05,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:46:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:05,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:46:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:05,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:46:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:05,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:46:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:05,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:46:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:05,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:46:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:05,848 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:46:05,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:05,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907507715] [2024-10-24 00:46:05,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907507715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:05,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:05,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:46:05,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755586948] [2024-10-24 00:46:05,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:05,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:46:05,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:05,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:46:05,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:46:05,850 INFO L87 Difference]: Start difference. First operand 923 states and 1571 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:46:06,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:06,829 INFO L93 Difference]: Finished difference Result 2277 states and 3937 transitions. [2024-10-24 00:46:06,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:46:06,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-10-24 00:46:06,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:06,844 INFO L225 Difference]: With dead ends: 2277 [2024-10-24 00:46:06,845 INFO L226 Difference]: Without dead ends: 1472 [2024-10-24 00:46:06,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:46:06,850 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 902 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:06,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 710 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 00:46:06,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2024-10-24 00:46:06,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1398. [2024-10-24 00:46:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1100 states have (on average 1.6381818181818182) internal successors, (1802), 1107 states have internal predecessors, (1802), 276 states have call successors, (276), 17 states have call predecessors, (276), 21 states have return successors, (307), 275 states have call predecessors, (307), 275 states have call successors, (307) [2024-10-24 00:46:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2385 transitions. [2024-10-24 00:46:06,969 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2385 transitions. Word has length 103 [2024-10-24 00:46:06,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:06,969 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 2385 transitions. [2024-10-24 00:46:06,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:46:06,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2385 transitions. [2024-10-24 00:46:06,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 00:46:06,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:06,977 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:46:06,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 00:46:06,978 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:06,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:06,978 INFO L85 PathProgramCache]: Analyzing trace with hash 486878879, now seen corresponding path program 1 times [2024-10-24 00:46:06,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:06,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488200947] [2024-10-24 00:46:06,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:06,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:46:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:46:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:46:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:46:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:46:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:46:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:46:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:07,103 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:46:07,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:07,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488200947] [2024-10-24 00:46:07,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488200947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:07,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:07,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:46:07,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047188089] [2024-10-24 00:46:07,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:07,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:46:07,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:07,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:46:07,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:46:07,106 INFO L87 Difference]: Start difference. First operand 1398 states and 2385 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:46:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:08,292 INFO L93 Difference]: Finished difference Result 3339 states and 5815 transitions. [2024-10-24 00:46:08,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:46:08,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-10-24 00:46:08,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:08,307 INFO L225 Difference]: With dead ends: 3339 [2024-10-24 00:46:08,308 INFO L226 Difference]: Without dead ends: 2187 [2024-10-24 00:46:08,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:46:08,315 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 900 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:08,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 702 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:46:08,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2024-10-24 00:46:08,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2113. [2024-10-24 00:46:08,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2113 states, 1692 states have (on average 1.6406619385342789) internal successors, (2776), 1699 states have internal predecessors, (2776), 399 states have call successors, (399), 17 states have call predecessors, (399), 21 states have return successors, (446), 398 states have call predecessors, (446), 398 states have call successors, (446) [2024-10-24 00:46:08,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 3621 transitions. [2024-10-24 00:46:08,450 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 3621 transitions. Word has length 104 [2024-10-24 00:46:08,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:08,451 INFO L471 AbstractCegarLoop]: Abstraction has 2113 states and 3621 transitions. [2024-10-24 00:46:08,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:46:08,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 3621 transitions. [2024-10-24 00:46:08,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 00:46:08,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:08,458 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:46:08,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 00:46:08,458 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:08,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:08,459 INFO L85 PathProgramCache]: Analyzing trace with hash 896014708, now seen corresponding path program 1 times [2024-10-24 00:46:08,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:08,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020683595] [2024-10-24 00:46:08,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:08,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:08,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:08,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:08,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:08,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:08,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:46:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:08,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:46:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:08,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:46:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:08,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:46:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:08,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:46:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:08,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:46:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:08,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:46:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:08,566 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:46:08,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:08,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020683595] [2024-10-24 00:46:08,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020683595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:08,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:08,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:46:08,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622501116] [2024-10-24 00:46:08,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:08,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:46:08,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:08,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:46:08,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:46:08,568 INFO L87 Difference]: Start difference. First operand 2113 states and 3621 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:46:09,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:09,627 INFO L93 Difference]: Finished difference Result 4981 states and 8728 transitions. [2024-10-24 00:46:09,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:46:09,628 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2024-10-24 00:46:09,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:09,653 INFO L225 Difference]: With dead ends: 4981 [2024-10-24 00:46:09,653 INFO L226 Difference]: Without dead ends: 3323 [2024-10-24 00:46:09,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:46:09,661 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 898 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:09,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 705 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:46:09,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2024-10-24 00:46:09,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 3249. [2024-10-24 00:46:09,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3249 states, 2649 states have (on average 1.6421291053227633) internal successors, (4350), 2656 states have internal predecessors, (4350), 578 states have call successors, (578), 17 states have call predecessors, (578), 21 states have return successors, (651), 577 states have call predecessors, (651), 577 states have call successors, (651) [2024-10-24 00:46:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3249 states to 3249 states and 5579 transitions. [2024-10-24 00:46:09,840 INFO L78 Accepts]: Start accepts. Automaton has 3249 states and 5579 transitions. Word has length 105 [2024-10-24 00:46:09,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:09,841 INFO L471 AbstractCegarLoop]: Abstraction has 3249 states and 5579 transitions. [2024-10-24 00:46:09,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:46:09,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3249 states and 5579 transitions. [2024-10-24 00:46:09,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 00:46:09,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:09,851 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:46:09,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 00:46:09,851 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:09,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:09,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1491279267, now seen corresponding path program 1 times [2024-10-24 00:46:09,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:09,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566149056] [2024-10-24 00:46:09,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:09,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:09,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:09,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:09,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:09,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:09,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:46:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:09,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:46:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:09,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:46:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:09,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:46:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:09,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:46:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:09,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:46:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:09,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:46:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:09,964 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:46:09,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:09,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566149056] [2024-10-24 00:46:09,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566149056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:09,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:09,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:46:09,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189120319] [2024-10-24 00:46:09,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:09,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:46:09,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:09,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:46:09,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:46:09,968 INFO L87 Difference]: Start difference. First operand 3249 states and 5579 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:46:11,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:11,175 INFO L93 Difference]: Finished difference Result 7936 states and 13926 transitions. [2024-10-24 00:46:11,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:46:11,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2024-10-24 00:46:11,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:11,212 INFO L225 Difference]: With dead ends: 7936 [2024-10-24 00:46:11,212 INFO L226 Difference]: Without dead ends: 5381 [2024-10-24 00:46:11,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:46:11,259 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 896 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:11,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 751 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:46:11,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5381 states. [2024-10-24 00:46:11,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5381 to 5307. [2024-10-24 00:46:11,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5307 states, 4331 states have (on average 1.6331101362271994) internal successors, (7073), 4338 states have internal predecessors, (7073), 954 states have call successors, (954), 17 states have call predecessors, (954), 21 states have return successors, (1071), 953 states have call predecessors, (1071), 953 states have call successors, (1071) [2024-10-24 00:46:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5307 states to 5307 states and 9098 transitions. [2024-10-24 00:46:11,542 INFO L78 Accepts]: Start accepts. Automaton has 5307 states and 9098 transitions. Word has length 106 [2024-10-24 00:46:11,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:11,542 INFO L471 AbstractCegarLoop]: Abstraction has 5307 states and 9098 transitions. [2024-10-24 00:46:11,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:46:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 5307 states and 9098 transitions. [2024-10-24 00:46:11,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 00:46:11,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:11,555 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:46:11,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 00:46:11,555 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:11,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:11,556 INFO L85 PathProgramCache]: Analyzing trace with hash 712109680, now seen corresponding path program 1 times [2024-10-24 00:46:11,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:11,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968519206] [2024-10-24 00:46:11,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:11,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:11,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:11,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:11,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:11,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:11,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:46:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:11,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:46:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:11,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:46:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:11,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:46:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:11,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:46:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:11,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:46:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:11,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:46:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:11,663 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:46:11,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:11,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968519206] [2024-10-24 00:46:11,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968519206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:11,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:11,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:46:11,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891580324] [2024-10-24 00:46:11,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:11,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:46:11,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:11,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:46:11,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:46:11,666 INFO L87 Difference]: Start difference. First operand 5307 states and 9098 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:46:12,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:12,841 INFO L93 Difference]: Finished difference Result 13141 states and 23010 transitions. [2024-10-24 00:46:12,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:46:12,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2024-10-24 00:46:12,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:12,905 INFO L225 Difference]: With dead ends: 13141 [2024-10-24 00:46:12,908 INFO L226 Difference]: Without dead ends: 8914 [2024-10-24 00:46:12,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:46:12,923 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 894 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:12,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 710 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 00:46:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8914 states. [2024-10-24 00:46:13,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8914 to 8840. [2024-10-24 00:46:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8840 states, 7258 states have (on average 1.6299255993386608) internal successors, (11830), 7265 states have internal predecessors, (11830), 1560 states have call successors, (1560), 17 states have call predecessors, (1560), 21 states have return successors, (1755), 1559 states have call predecessors, (1755), 1559 states have call successors, (1755) [2024-10-24 00:46:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 15145 transitions. [2024-10-24 00:46:13,387 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 15145 transitions. Word has length 107 [2024-10-24 00:46:13,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:13,387 INFO L471 AbstractCegarLoop]: Abstraction has 8840 states and 15145 transitions. [2024-10-24 00:46:13,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:46:13,388 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 15145 transitions. [2024-10-24 00:46:13,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 00:46:13,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:13,404 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:46:13,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 00:46:13,404 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:13,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:13,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1142743585, now seen corresponding path program 1 times [2024-10-24 00:46:13,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:13,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250336976] [2024-10-24 00:46:13,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:13,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:13,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:13,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:13,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:13,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:13,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:46:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:13,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:46:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:13,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:46:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:13,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:46:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:13,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:46:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:13,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:46:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:13,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:46:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:13,522 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:46:13,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:13,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250336976] [2024-10-24 00:46:13,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250336976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:13,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:13,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:46:13,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294163677] [2024-10-24 00:46:13,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:13,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:46:13,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:13,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:46:13,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:46:13,527 INFO L87 Difference]: Start difference. First operand 8840 states and 15145 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:46:14,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:14,951 INFO L93 Difference]: Finished difference Result 22913 states and 40039 transitions. [2024-10-24 00:46:14,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:46:14,953 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-10-24 00:46:14,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:15,032 INFO L225 Difference]: With dead ends: 22913 [2024-10-24 00:46:15,033 INFO L226 Difference]: Without dead ends: 15586 [2024-10-24 00:46:15,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:46:15,062 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 892 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:15,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 740 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:46:15,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15586 states. [2024-10-24 00:46:15,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15586 to 15512. [2024-10-24 00:46:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15512 states, 12727 states have (on average 1.620099002121474) internal successors, (20619), 12734 states have internal predecessors, (20619), 2763 states have call successors, (2763), 17 states have call predecessors, (2763), 21 states have return successors, (3102), 2762 states have call predecessors, (3102), 2762 states have call successors, (3102) [2024-10-24 00:46:15,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15512 states to 15512 states and 26484 transitions. [2024-10-24 00:46:15,878 INFO L78 Accepts]: Start accepts. Automaton has 15512 states and 26484 transitions. Word has length 108 [2024-10-24 00:46:15,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:15,881 INFO L471 AbstractCegarLoop]: Abstraction has 15512 states and 26484 transitions. [2024-10-24 00:46:15,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:46:15,882 INFO L276 IsEmpty]: Start isEmpty. Operand 15512 states and 26484 transitions. [2024-10-24 00:46:15,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 00:46:15,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:15,904 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:46:15,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 00:46:15,904 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:15,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:15,905 INFO L85 PathProgramCache]: Analyzing trace with hash 293460047, now seen corresponding path program 1 times [2024-10-24 00:46:15,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:15,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419050072] [2024-10-24 00:46:15,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:15,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:46:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:46:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:15,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:46:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:16,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:46:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:16,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:46:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:16,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:46:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:16,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:46:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:16,010 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:46:16,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:16,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419050072] [2024-10-24 00:46:16,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419050072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:16,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:16,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:46:16,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746239473] [2024-10-24 00:46:16,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:16,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:46:16,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:16,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:46:16,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:46:16,013 INFO L87 Difference]: Start difference. First operand 15512 states and 26484 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:46:17,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:17,492 INFO L93 Difference]: Finished difference Result 41080 states and 71637 transitions. [2024-10-24 00:46:17,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:46:17,493 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2024-10-24 00:46:17,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:17,627 INFO L225 Difference]: With dead ends: 41080 [2024-10-24 00:46:17,627 INFO L226 Difference]: Without dead ends: 27701 [2024-10-24 00:46:17,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:46:17,677 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 890 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:17,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 703 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 00:46:17,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27701 states. [2024-10-24 00:46:19,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27701 to 27627. [2024-10-24 00:46:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27627 states, 22803 states have (on average 1.6158400210498618) internal successors, (36846), 22810 states have internal predecessors, (36846), 4802 states have call successors, (4802), 17 states have call predecessors, (4802), 21 states have return successors, (5415), 4801 states have call predecessors, (5415), 4801 states have call successors, (5415) [2024-10-24 00:46:19,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27627 states to 27627 states and 47063 transitions. [2024-10-24 00:46:19,299 INFO L78 Accepts]: Start accepts. Automaton has 27627 states and 47063 transitions. Word has length 109 [2024-10-24 00:46:19,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:19,300 INFO L471 AbstractCegarLoop]: Abstraction has 27627 states and 47063 transitions. [2024-10-24 00:46:19,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:46:19,300 INFO L276 IsEmpty]: Start isEmpty. Operand 27627 states and 47063 transitions. [2024-10-24 00:46:19,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 00:46:19,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:19,582 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:46:19,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 00:46:19,583 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:19,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:19,583 INFO L85 PathProgramCache]: Analyzing trace with hash 547648063, now seen corresponding path program 1 times [2024-10-24 00:46:19,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:19,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526347409] [2024-10-24 00:46:19,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:19,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:19,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:19,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:19,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:19,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:19,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:46:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:19,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:46:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:19,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:46:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:19,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:46:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:19,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:46:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:19,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:46:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:19,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:46:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:19,701 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:46:19,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:19,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526347409] [2024-10-24 00:46:19,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526347409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:19,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:19,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:46:19,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682581540] [2024-10-24 00:46:19,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:19,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:46:19,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:19,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:46:19,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:46:19,704 INFO L87 Difference]: Start difference. First operand 27627 states and 47063 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:46:21,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:21,959 INFO L93 Difference]: Finished difference Result 75272 states and 130431 transitions. [2024-10-24 00:46:21,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:46:21,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2024-10-24 00:46:21,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:22,234 INFO L225 Difference]: With dead ends: 75272 [2024-10-24 00:46:22,234 INFO L226 Difference]: Without dead ends: 50525 [2024-10-24 00:46:22,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:46:22,324 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 888 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:22,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 709 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:46:22,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50525 states. [2024-10-24 00:46:24,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50525 to 50451. [2024-10-24 00:46:24,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50451 states, 41912 states have (on average 1.6103741171979384) internal successors, (67494), 41919 states have internal predecessors, (67494), 8517 states have call successors, (8517), 17 states have call predecessors, (8517), 21 states have return successors, (9662), 8516 states have call predecessors, (9662), 8516 states have call successors, (9662) [2024-10-24 00:46:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50451 states to 50451 states and 85673 transitions. [2024-10-24 00:46:24,811 INFO L78 Accepts]: Start accepts. Automaton has 50451 states and 85673 transitions. Word has length 110 [2024-10-24 00:46:24,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:24,812 INFO L471 AbstractCegarLoop]: Abstraction has 50451 states and 85673 transitions. [2024-10-24 00:46:24,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:46:24,812 INFO L276 IsEmpty]: Start isEmpty. Operand 50451 states and 85673 transitions. [2024-10-24 00:46:24,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 00:46:24,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:24,838 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:46:24,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 00:46:24,838 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:24,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:24,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1110166511, now seen corresponding path program 1 times [2024-10-24 00:46:24,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:24,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876665619] [2024-10-24 00:46:24,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:24,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:24,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:24,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:24,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:24,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:24,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:46:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:24,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:46:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:24,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:46:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:24,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:46:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:24,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:46:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:24,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:46:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:24,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 00:46:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:46:24,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:24,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876665619] [2024-10-24 00:46:24,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876665619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:24,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:24,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:46:24,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724872990] [2024-10-24 00:46:24,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:24,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:46:24,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:24,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:46:24,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:46:24,955 INFO L87 Difference]: Start difference. First operand 50451 states and 85673 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:46:28,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:28,325 INFO L93 Difference]: Finished difference Result 94019 states and 163337 transitions. [2024-10-24 00:46:28,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:46:28,326 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2024-10-24 00:46:28,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:28,787 INFO L225 Difference]: With dead ends: 94019 [2024-10-24 00:46:28,788 INFO L226 Difference]: Without dead ends: 93905 [2024-10-24 00:46:28,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:46:28,838 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 883 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:28,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 712 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 00:46:28,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93905 states. [2024-10-24 00:46:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93905 to 93831. [2024-10-24 00:46:32,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93831 states, 78493 states have (on average 1.6034805651459365) internal successors, (125862), 78500 states have internal predecessors, (125862), 15316 states have call successors, (15316), 17 states have call predecessors, (15316), 21 states have return successors, (17507), 15315 states have call predecessors, (17507), 15315 states have call successors, (17507) [2024-10-24 00:46:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93831 states to 93831 states and 158685 transitions. [2024-10-24 00:46:32,470 INFO L78 Accepts]: Start accepts. Automaton has 93831 states and 158685 transitions. Word has length 111 [2024-10-24 00:46:32,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:32,470 INFO L471 AbstractCegarLoop]: Abstraction has 93831 states and 158685 transitions. [2024-10-24 00:46:32,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:46:32,471 INFO L276 IsEmpty]: Start isEmpty. Operand 93831 states and 158685 transitions. [2024-10-24 00:46:32,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 00:46:32,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:32,497 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:46:32,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 00:46:32,497 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:32,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:32,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1607342880, now seen corresponding path program 1 times [2024-10-24 00:46:32,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:32,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345836532] [2024-10-24 00:46:32,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:32,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:33,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:33,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:33,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:33,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:33,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:46:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:33,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:46:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:33,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:46:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:33,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:46:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:33,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:46:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:33,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:46:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:33,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 00:46:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:46:33,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:33,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345836532] [2024-10-24 00:46:33,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345836532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:33,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:33,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-24 00:46:33,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645166136] [2024-10-24 00:46:33,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:33,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 00:46:33,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:33,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 00:46:33,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2024-10-24 00:46:33,402 INFO L87 Difference]: Start difference. First operand 93831 states and 158685 transitions. Second operand has 16 states, 15 states have (on average 5.0) internal successors, (75), 10 states have internal predecessors, (75), 5 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-24 00:46:41,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:46:41,528 INFO L93 Difference]: Finished difference Result 187154 states and 328512 transitions. [2024-10-24 00:46:41,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-24 00:46:41,531 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 10 states have internal predecessors, (75), 5 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 112 [2024-10-24 00:46:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:46:42,398 INFO L225 Difference]: With dead ends: 187154 [2024-10-24 00:46:42,399 INFO L226 Difference]: Without dead ends: 187045 [2024-10-24 00:46:42,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 955 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=715, Invalid=2825, Unknown=0, NotChecked=0, Total=3540 [2024-10-24 00:46:42,475 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 3042 mSDsluCounter, 2126 mSDsCounter, 0 mSdLazyCounter, 5210 mSolverCounterSat, 882 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3042 SdHoareTripleChecker+Valid, 2337 SdHoareTripleChecker+Invalid, 6092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 882 IncrementalHoareTripleChecker+Valid, 5210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-24 00:46:42,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3042 Valid, 2337 Invalid, 6092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [882 Valid, 5210 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-24 00:46:42,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187045 states. [2024-10-24 00:46:49,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187045 to 186827. [2024-10-24 00:46:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186827 states, 156357 states have (on average 1.6044500725902902) internal successors, (250867), 156260 states have internal predecessors, (250867), 30417 states have call successors, (30417), 44 states have call predecessors, (30417), 52 states have return successors, (38073), 30528 states have call predecessors, (38073), 30414 states have call successors, (38073) [2024-10-24 00:46:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186827 states to 186827 states and 319357 transitions. [2024-10-24 00:46:50,741 INFO L78 Accepts]: Start accepts. Automaton has 186827 states and 319357 transitions. Word has length 112 [2024-10-24 00:46:50,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:46:50,742 INFO L471 AbstractCegarLoop]: Abstraction has 186827 states and 319357 transitions. [2024-10-24 00:46:50,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 10 states have internal predecessors, (75), 5 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-24 00:46:50,742 INFO L276 IsEmpty]: Start isEmpty. Operand 186827 states and 319357 transitions. [2024-10-24 00:46:50,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 00:46:50,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:46:50,784 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:46:50,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 00:46:50,784 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:46:50,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:46:50,785 INFO L85 PathProgramCache]: Analyzing trace with hash -986979462, now seen corresponding path program 1 times [2024-10-24 00:46:50,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:46:50,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650641160] [2024-10-24 00:46:50,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:46:50,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:46:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:46:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:46:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:46:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:46:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:46:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:46:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:46:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:46:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:46:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:46:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 00:46:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:46:50,988 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:46:50,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:46:50,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650641160] [2024-10-24 00:46:50,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650641160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:46:50,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:46:50,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:46:50,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353955382] [2024-10-24 00:46:50,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:46:50,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:46:50,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:46:50,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:46:50,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:46:50,990 INFO L87 Difference]: Start difference. First operand 186827 states and 319357 transitions. Second operand has 12 states, 10 states have (on average 7.6) internal successors, (76), 7 states have internal predecessors, (76), 5 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11)