./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_spec3_product17.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product17.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ece4fa184f09e2184919c279a0198f8db6972fb16f8b142297bd588b2043b23f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:47:21,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:47:21,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:47:21,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:47:21,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:47:21,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:47:21,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:47:21,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:47:21,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:47:21,137 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:47:21,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:47:21,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:47:21,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:47:21,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:47:21,142 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:47:21,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:47:21,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:47:21,143 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:47:21,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:47:21,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:47:21,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:47:21,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:47:21,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:47:21,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:47:21,150 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:47:21,150 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:47:21,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:47:21,150 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:47:21,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:47:21,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:47:21,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:47:21,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:47:21,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:47:21,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:47:21,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:47:21,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:47:21,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:47:21,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:47:21,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:47:21,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:47:21,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:47:21,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:47:21,155 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ece4fa184f09e2184919c279a0198f8db6972fb16f8b142297bd588b2043b23f [2024-10-11 02:47:21,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:47:21,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:47:21,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:47:21,426 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:47:21,429 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:47:21,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product17.cil.c [2024-10-11 02:47:23,020 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:47:23,277 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:47:23,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product17.cil.c [2024-10-11 02:47:23,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c03e7dbef/28270a7bce074a049491eac125101e3f/FLAG0118936fe [2024-10-11 02:47:23,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c03e7dbef/28270a7bce074a049491eac125101e3f [2024-10-11 02:47:23,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:47:23,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:47:23,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:47:23,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:47:23,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:47:23,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:47:23" (1/1) ... [2024-10-11 02:47:23,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9bd0171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:23, skipping insertion in model container [2024-10-11 02:47:23,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:47:23" (1/1) ... [2024-10-11 02:47:23,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:47:23,834 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_spec3_product17.cil.c[63718,63731] [2024-10-11 02:47:23,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:47:23,851 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:47:23,859 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2024-10-11 02:47:23,861 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [368] [2024-10-11 02:47:23,861 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [403] [2024-10-11 02:47:23,861 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [769] [2024-10-11 02:47:23,862 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [985] [2024-10-11 02:47:23,862 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1304] [2024-10-11 02:47:23,862 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [1321] [2024-10-11 02:47:23,862 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1380] [2024-10-11 02:47:23,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2444] [2024-10-11 02:47:23,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2543] [2024-10-11 02:47:23,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2944] [2024-10-11 02:47:23,972 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_spec3_product17.cil.c[63718,63731] [2024-10-11 02:47:23,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:47:24,012 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:47:24,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:24 WrapperNode [2024-10-11 02:47:24,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:47:24,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:47:24,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:47:24,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:47:24,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:24" (1/1) ... [2024-10-11 02:47:24,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:24" (1/1) ... [2024-10-11 02:47:24,098 INFO L138 Inliner]: procedures = 128, calls = 199, calls flagged for inlining = 52, calls inlined = 45, statements flattened = 894 [2024-10-11 02:47:24,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:47:24,102 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:47:24,102 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:47:24,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:47:24,115 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:24" (1/1) ... [2024-10-11 02:47:24,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:24" (1/1) ... [2024-10-11 02:47:24,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:24" (1/1) ... [2024-10-11 02:47:24,157 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-10-11 02:47:24,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:24" (1/1) ... [2024-10-11 02:47:24,158 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:24" (1/1) ... [2024-10-11 02:47:24,178 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:24" (1/1) ... [2024-10-11 02:47:24,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:24" (1/1) ... [2024-10-11 02:47:24,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:24" (1/1) ... [2024-10-11 02:47:24,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:24" (1/1) ... [2024-10-11 02:47:24,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:47:24,195 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:47:24,195 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:47:24,196 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:47:24,196 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:24" (1/1) ... [2024-10-11 02:47:24,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:47:24,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:47:24,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:47:24,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:47:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2024-10-11 02:47:24,307 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2024-10-11 02:47:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2024-10-11 02:47:24,307 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2024-10-11 02:47:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2024-10-11 02:47:24,308 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2024-10-11 02:47:24,308 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-11 02:47:24,309 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-11 02:47:24,309 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-11 02:47:24,309 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-11 02:47:24,309 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-11 02:47:24,310 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-11 02:47:24,310 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-11 02:47:24,310 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-11 02:47:24,310 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-11 02:47:24,310 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-11 02:47:24,311 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-11 02:47:24,311 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-11 02:47:24,311 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-11 02:47:24,311 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-11 02:47:24,312 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-11 02:47:24,313 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-11 02:47:24,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:47:24,313 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-11 02:47:24,313 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-11 02:47:24,313 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-11 02:47:24,314 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-11 02:47:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2024-10-11 02:47:24,314 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2024-10-11 02:47:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-11 02:47:24,314 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-11 02:47:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-11 02:47:24,314 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-11 02:47:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-11 02:47:24,316 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-11 02:47:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-11 02:47:24,317 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-11 02:47:24,317 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-10-11 02:47:24,317 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-10-11 02:47:24,317 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-11 02:47:24,317 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-11 02:47:24,317 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-11 02:47:24,317 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-11 02:47:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-11 02:47:24,318 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-11 02:47:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:47:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:47:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:47:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:47:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-11 02:47:24,319 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-11 02:47:24,319 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2024-10-11 02:47:24,319 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2024-10-11 02:47:24,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:47:24,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:47:24,511 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:47:24,514 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:47:25,208 INFO L? ?]: Removed 466 outVars from TransFormulas that were not future-live. [2024-10-11 02:47:25,208 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:47:25,268 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:47:25,269 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:47:25,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:47:25 BoogieIcfgContainer [2024-10-11 02:47:25,270 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:47:25,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:47:25,272 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:47:25,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:47:25,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:47:23" (1/3) ... [2024-10-11 02:47:25,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d196118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:47:25, skipping insertion in model container [2024-10-11 02:47:25,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:47:24" (2/3) ... [2024-10-11 02:47:25,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d196118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:47:25, skipping insertion in model container [2024-10-11 02:47:25,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:47:25" (3/3) ... [2024-10-11 02:47:25,277 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec3_product17.cil.c [2024-10-11 02:47:25,293 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:47:25,293 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:47:25,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:47:25,452 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;@77d4972c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:47:25,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:47:25,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 343 states, 261 states have (on average 1.6245210727969348) internal successors, (424), 266 states have internal predecessors, (424), 56 states have call successors, (56), 24 states have call predecessors, (56), 24 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 02:47:25,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 02:47:25,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:47:25,502 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:47:25,531 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:47:25,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:47:25,536 INFO L85 PathProgramCache]: Analyzing trace with hash 165125239, now seen corresponding path program 1 times [2024-10-11 02:47:25,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:47:25,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480477522] [2024-10-11 02:47:25,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:25,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:47:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:26,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:47:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:26,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:47:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:26,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:47:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:26,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:47:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:26,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:47:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:26,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:47:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:26,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:47:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:26,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:47:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:26,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:47:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:26,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:47:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:26,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:47:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:26,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:47:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:26,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:47:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:26,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:47:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:26,227 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-11 02:47:26,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:47:26,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480477522] [2024-10-11 02:47:26,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480477522] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:47:26,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42054035] [2024-10-11 02:47:26,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:26,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:47:26,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:47:26,234 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:47:26,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:47:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:26,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 02:47:26,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:47:26,526 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-11 02:47:26,527 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:47:26,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42054035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:47:26,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:47:26,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-11 02:47:26,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946053236] [2024-10-11 02:47:26,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:47:26,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:47:26,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:47:26,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:47:26,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:47:26,566 INFO L87 Difference]: Start difference. First operand has 343 states, 261 states have (on average 1.6245210727969348) internal successors, (424), 266 states have internal predecessors, (424), 56 states have call successors, (56), 24 states have call predecessors, (56), 24 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:47:26,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:47:26,666 INFO L93 Difference]: Finished difference Result 505 states and 778 transitions. [2024-10-11 02:47:26,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:47:26,671 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2024-10-11 02:47:26,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:47:26,691 INFO L225 Difference]: With dead ends: 505 [2024-10-11 02:47:26,691 INFO L226 Difference]: Without dead ends: 339 [2024-10-11 02:47:26,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:47:26,703 INFO L432 NwaCegarLoop]: 517 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:47:26,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 517 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:47:26,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-10-11 02:47:26,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2024-10-11 02:47:26,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 259 states have (on average 1.61003861003861) internal successors, (417), 262 states have internal predecessors, (417), 56 states have call successors, (56), 24 states have call predecessors, (56), 23 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-11 02:47:26,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 526 transitions. [2024-10-11 02:47:26,838 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 526 transitions. Word has length 105 [2024-10-11 02:47:26,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:47:26,840 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 526 transitions. [2024-10-11 02:47:26,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:47:26,844 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 526 transitions. [2024-10-11 02:47:26,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 02:47:26,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:47:26,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:47:26,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:47:27,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-11 02:47:27,057 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:47:27,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:47:27,060 INFO L85 PathProgramCache]: Analyzing trace with hash -49291333, now seen corresponding path program 1 times [2024-10-11 02:47:27,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:47:27,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089279475] [2024-10-11 02:47:27,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:27,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:47:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:27,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:47:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:27,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:47:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:27,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:47:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:27,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:47:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:27,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:47:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:27,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:47:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:27,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:47:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:27,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:47:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:27,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:47:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:27,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:47:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:27,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:47:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:27,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:47:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:27,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:47:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:27,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:47:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:27,393 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-11 02:47:27,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:47:27,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089279475] [2024-10-11 02:47:27,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089279475] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:47:27,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248531013] [2024-10-11 02:47:27,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:27,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:47:27,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:47:27,396 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:47:27,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:47:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:27,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:47:27,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:47:27,681 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-11 02:47:27,685 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:47:27,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248531013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:47:27,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:47:27,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:47:27,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294549804] [2024-10-11 02:47:27,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:47:27,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:47:27,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:47:27,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:47:27,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:47:27,688 INFO L87 Difference]: Start difference. First operand 339 states and 526 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:47:27,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:47:27,768 INFO L93 Difference]: Finished difference Result 500 states and 758 transitions. [2024-10-11 02:47:27,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:47:27,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 106 [2024-10-11 02:47:27,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:47:27,776 INFO L225 Difference]: With dead ends: 500 [2024-10-11 02:47:27,776 INFO L226 Difference]: Without dead ends: 341 [2024-10-11 02:47:27,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 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-11 02:47:27,781 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 0 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:47:27,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1027 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:47:27,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-10-11 02:47:27,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2024-10-11 02:47:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 261 states have (on average 1.6053639846743295) internal successors, (419), 264 states have internal predecessors, (419), 56 states have call successors, (56), 24 states have call predecessors, (56), 23 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-11 02:47:27,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 528 transitions. [2024-10-11 02:47:27,809 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 528 transitions. Word has length 106 [2024-10-11 02:47:27,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:47:27,809 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 528 transitions. [2024-10-11 02:47:27,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:47:27,810 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 528 transitions. [2024-10-11 02:47:27,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 02:47:27,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:47:27,813 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:47:27,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:47:28,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:47:28,014 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:47:28,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:47:28,014 INFO L85 PathProgramCache]: Analyzing trace with hash 534112346, now seen corresponding path program 1 times [2024-10-11 02:47:28,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:47:28,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899171191] [2024-10-11 02:47:28,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:28,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:47:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:28,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:47:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:28,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:47:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:28,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:47:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:28,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:47:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:28,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:47:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:28,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:47:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:28,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:47:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:28,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:47:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:28,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:47:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:28,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:47:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:28,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:47:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:28,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:47:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:28,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:47:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:28,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:47:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:28,278 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-11 02:47:28,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:47:28,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899171191] [2024-10-11 02:47:28,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899171191] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:47:28,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74844356] [2024-10-11 02:47:28,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:28,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:47:28,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:47:28,283 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:47:28,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:47:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:28,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:47:28,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:47:28,591 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-11 02:47:28,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:47:28,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74844356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:47:28,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:47:28,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:47:28,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601299320] [2024-10-11 02:47:28,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:47:28,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:47:28,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:47:28,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:47:28,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:47:28,593 INFO L87 Difference]: Start difference. First operand 341 states and 528 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:47:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:47:28,630 INFO L93 Difference]: Finished difference Result 726 states and 1141 transitions. [2024-10-11 02:47:28,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:47:28,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2024-10-11 02:47:28,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:47:28,633 INFO L225 Difference]: With dead ends: 726 [2024-10-11 02:47:28,633 INFO L226 Difference]: Without dead ends: 407 [2024-10-11 02:47:28,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 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-11 02:47:28,635 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 122 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 997 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-11 02:47:28,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 997 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:47:28,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-11 02:47:28,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 402. [2024-10-11 02:47:28,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 308 states have (on average 1.62012987012987) internal successors, (499), 311 states have internal predecessors, (499), 70 states have call successors, (70), 24 states have call predecessors, (70), 23 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2024-10-11 02:47:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 636 transitions. [2024-10-11 02:47:28,650 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 636 transitions. Word has length 111 [2024-10-11 02:47:28,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:47:28,650 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 636 transitions. [2024-10-11 02:47:28,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:47:28,651 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 636 transitions. [2024-10-11 02:47:28,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 02:47:28,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:47:28,653 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:47:28,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 02:47:28,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:47:28,854 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:47:28,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:47:28,855 INFO L85 PathProgramCache]: Analyzing trace with hash 456030610, now seen corresponding path program 1 times [2024-10-11 02:47:28,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:47:28,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027634913] [2024-10-11 02:47:28,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:28,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:47:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:47:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:47:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:47:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:47:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:47:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:47:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:47:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:47:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:47:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:47:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:47:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:47:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:47:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:47:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,064 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-11 02:47:29,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:47:29,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027634913] [2024-10-11 02:47:29,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027634913] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:47:29,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760868779] [2024-10-11 02:47:29,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:29,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:47:29,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:47:29,066 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:47:29,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 02:47:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 02:47:29,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:47:29,325 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-11 02:47:29,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:47:29,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760868779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:47:29,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:47:29,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-11 02:47:29,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936187962] [2024-10-11 02:47:29,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:47:29,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:47:29,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:47:29,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:47:29,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:47:29,327 INFO L87 Difference]: Start difference. First operand 402 states and 636 transitions. Second operand has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:47:29,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:47:29,400 INFO L93 Difference]: Finished difference Result 799 states and 1266 transitions. [2024-10-11 02:47:29,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:47:29,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 112 [2024-10-11 02:47:29,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:47:29,403 INFO L225 Difference]: With dead ends: 799 [2024-10-11 02:47:29,403 INFO L226 Difference]: Without dead ends: 404 [2024-10-11 02:47:29,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 133 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-11 02:47:29,405 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 2 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2013 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:47:29,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2013 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:47:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-10-11 02:47:29,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2024-10-11 02:47:29,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 309 states have (on average 1.6181229773462784) internal successors, (500), 313 states have internal predecessors, (500), 70 states have call successors, (70), 24 states have call predecessors, (70), 24 states have return successors, (69), 66 states have call predecessors, (69), 67 states have call successors, (69) [2024-10-11 02:47:29,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 639 transitions. [2024-10-11 02:47:29,429 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 639 transitions. Word has length 112 [2024-10-11 02:47:29,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:47:29,429 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 639 transitions. [2024-10-11 02:47:29,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:47:29,430 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 639 transitions. [2024-10-11 02:47:29,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 02:47:29,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:47:29,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:47:29,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 02:47:29,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:47:29,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:47:29,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:47:29,634 INFO L85 PathProgramCache]: Analyzing trace with hash 893323891, now seen corresponding path program 1 times [2024-10-11 02:47:29,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:47:29,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287565022] [2024-10-11 02:47:29,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:29,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:47:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:47:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:47:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:47:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:47:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:47:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:47:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:47:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:47:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:47:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:47:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:47:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:47:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:47:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:47:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:29,893 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-11 02:47:29,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:47:29,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287565022] [2024-10-11 02:47:29,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287565022] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:47:29,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664123438] [2024-10-11 02:47:29,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:29,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:47:29,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:47:29,896 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:47:29,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 02:47:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:30,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 02:47:30,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:47:30,237 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-11 02:47:30,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:47:30,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664123438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:47:30,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:47:30,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-11 02:47:30,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365367340] [2024-10-11 02:47:30,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:47:30,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:47:30,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:47:30,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:47:30,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:47:30,241 INFO L87 Difference]: Start difference. First operand 404 states and 639 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:47:30,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:47:30,340 INFO L93 Difference]: Finished difference Result 801 states and 1271 transitions. [2024-10-11 02:47:30,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:47:30,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2024-10-11 02:47:30,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:47:30,343 INFO L225 Difference]: With dead ends: 801 [2024-10-11 02:47:30,345 INFO L226 Difference]: Without dead ends: 406 [2024-10-11 02:47:30,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 133 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-11 02:47:30,347 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 2 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:47:30,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1999 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:47:30,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-11 02:47:30,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2024-10-11 02:47:30,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 310 states have (on average 1.6161290322580646) internal successors, (501), 315 states have internal predecessors, (501), 70 states have call successors, (70), 24 states have call predecessors, (70), 25 states have return successors, (74), 66 states have call predecessors, (74), 67 states have call successors, (74) [2024-10-11 02:47:30,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 645 transitions. [2024-10-11 02:47:30,380 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 645 transitions. Word has length 113 [2024-10-11 02:47:30,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:47:30,380 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 645 transitions. [2024-10-11 02:47:30,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:47:30,381 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 645 transitions. [2024-10-11 02:47:30,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 02:47:30,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:47:30,387 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:47:30,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 02:47:30,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:47:30,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:47:30,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:47:30,593 INFO L85 PathProgramCache]: Analyzing trace with hash 596002058, now seen corresponding path program 1 times [2024-10-11 02:47:30,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:47:30,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457797598] [2024-10-11 02:47:30,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:30,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:47:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:30,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:47:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:30,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:47:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:30,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:47:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:30,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:47:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:30,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:47:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:30,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:47:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:30,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:47:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:30,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:47:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:30,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:47:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:30,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:47:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:30,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:47:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:30,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:47:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:30,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:47:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:30,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:47:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:30,941 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-11 02:47:30,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:47:30,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457797598] [2024-10-11 02:47:30,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457797598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:47:30,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:47:30,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:47:30,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702739179] [2024-10-11 02:47:30,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:47:30,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:47:30,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:47:30,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:47:30,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:47:30,943 INFO L87 Difference]: Start difference. First operand 406 states and 645 transitions. Second operand has 9 states, 8 states have (on average 8.875) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:47:32,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:47:32,890 INFO L93 Difference]: Finished difference Result 875 states and 1411 transitions. [2024-10-11 02:47:32,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:47:32,891 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 114 [2024-10-11 02:47:32,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:47:32,897 INFO L225 Difference]: With dead ends: 875 [2024-10-11 02:47:32,897 INFO L226 Difference]: Without dead ends: 488 [2024-10-11 02:47:32,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 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-11 02:47:32,900 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1139 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 2128 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 2513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 2128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:47:32,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 1149 Invalid, 2513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 2128 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 02:47:32,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-10-11 02:47:32,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 406. [2024-10-11 02:47:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 310 states have (on average 1.6161290322580646) internal successors, (501), 315 states have internal predecessors, (501), 70 states have call successors, (70), 24 states have call predecessors, (70), 25 states have return successors, (73), 66 states have call predecessors, (73), 67 states have call successors, (73) [2024-10-11 02:47:32,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 644 transitions. [2024-10-11 02:47:32,942 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 644 transitions. Word has length 114 [2024-10-11 02:47:32,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:47:32,943 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 644 transitions. [2024-10-11 02:47:32,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:47:32,943 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 644 transitions. [2024-10-11 02:47:32,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 02:47:32,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:47:32,946 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:47:32,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:47:32,947 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:47:32,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:47:32,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1688011533, now seen corresponding path program 2 times [2024-10-11 02:47:32,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:47:32,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250490286] [2024-10-11 02:47:32,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:32,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:47:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:33,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:47:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:33,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:47:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:33,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:47:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:33,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:47:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:33,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:47:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:33,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:47:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:33,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:47:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:33,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:47:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:33,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:47:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:33,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:47:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:33,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:47:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:33,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:47:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:33,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:47:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:33,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:47:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:33,146 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-11 02:47:33,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:47:33,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250490286] [2024-10-11 02:47:33,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250490286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:47:33,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:47:33,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:47:33,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485586633] [2024-10-11 02:47:33,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:47:33,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:47:33,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:47:33,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:47:33,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:47:33,147 INFO L87 Difference]: Start difference. First operand 406 states and 644 transitions. Second operand has 9 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:47:34,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:47:34,996 INFO L93 Difference]: Finished difference Result 877 states and 1414 transitions. [2024-10-11 02:47:34,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:47:34,997 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2024-10-11 02:47:34,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:47:35,004 INFO L225 Difference]: With dead ends: 877 [2024-10-11 02:47:35,004 INFO L226 Difference]: Without dead ends: 490 [2024-10-11 02:47:35,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 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-11 02:47:35,006 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1134 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 2158 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 2540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 2158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:47:35,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 1149 Invalid, 2540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 2158 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 02:47:35,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-10-11 02:47:35,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 408. [2024-10-11 02:47:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 311 states have (on average 1.6141479099678457) internal successors, (502), 317 states have internal predecessors, (502), 70 states have call successors, (70), 24 states have call predecessors, (70), 26 states have return successors, (75), 66 states have call predecessors, (75), 67 states have call successors, (75) [2024-10-11 02:47:35,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 647 transitions. [2024-10-11 02:47:35,041 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 647 transitions. Word has length 115 [2024-10-11 02:47:35,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:47:35,041 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 647 transitions. [2024-10-11 02:47:35,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:47:35,041 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 647 transitions. [2024-10-11 02:47:35,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 02:47:35,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:47:35,065 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:47:35,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:47:35,065 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:47:35,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:47:35,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1369776827, now seen corresponding path program 1 times [2024-10-11 02:47:35,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:47:35,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681357416] [2024-10-11 02:47:35,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:35,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:47:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:35,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:47:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:35,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:47:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:35,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:47:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:35,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:47:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:35,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:47:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:35,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:47:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:35,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:47:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:35,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:47:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:35,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:47:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:35,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:47:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:35,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:47:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:35,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:47:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:35,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:47:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:35,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:47:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:35,300 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-11 02:47:35,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:47:35,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681357416] [2024-10-11 02:47:35,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681357416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:47:35,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:47:35,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:47:35,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574045798] [2024-10-11 02:47:35,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:47:35,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:47:35,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:47:35,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:47:35,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:47:35,301 INFO L87 Difference]: Start difference. First operand 408 states and 647 transitions. Second operand has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-11 02:47:37,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:47:37,660 INFO L93 Difference]: Finished difference Result 875 states and 1409 transitions. [2024-10-11 02:47:37,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:47:37,661 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 116 [2024-10-11 02:47:37,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:47:37,664 INFO L225 Difference]: With dead ends: 875 [2024-10-11 02:47:37,664 INFO L226 Difference]: Without dead ends: 490 [2024-10-11 02:47:37,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:47:37,668 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1136 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 3623 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 4010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 3623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:47:37,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1137 Valid, 1598 Invalid, 4010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 3623 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 02:47:37,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-10-11 02:47:37,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 408. [2024-10-11 02:47:37,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 311 states have (on average 1.6141479099678457) internal successors, (502), 317 states have internal predecessors, (502), 70 states have call successors, (70), 24 states have call predecessors, (70), 26 states have return successors, (74), 66 states have call predecessors, (74), 67 states have call successors, (74) [2024-10-11 02:47:37,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 646 transitions. [2024-10-11 02:47:37,696 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 646 transitions. Word has length 116 [2024-10-11 02:47:37,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:47:37,696 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 646 transitions. [2024-10-11 02:47:37,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-11 02:47:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 646 transitions. [2024-10-11 02:47:37,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 02:47:37,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:47:37,698 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:47:37,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:47:37,698 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:47:37,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:47:37,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1752670035, now seen corresponding path program 1 times [2024-10-11 02:47:37,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:47:37,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423101073] [2024-10-11 02:47:37,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:37,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:47:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:37,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:47:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:37,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:47:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:37,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:47:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:37,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:47:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:37,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:47:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:37,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:47:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:37,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:47:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:37,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:47:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:37,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:47:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:37,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:47:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:37,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:47:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:37,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:47:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:37,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:47:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:37,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:47:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:37,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:47:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:37,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 02:47:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:37,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 02:47:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:37,997 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 02:47:37,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:47:37,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423101073] [2024-10-11 02:47:37,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423101073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:47:37,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:47:37,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:47:37,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243774078] [2024-10-11 02:47:37,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:47:37,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:47:37,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:47:37,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:47:37,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:47:38,000 INFO L87 Difference]: Start difference. First operand 408 states and 646 transitions. Second operand has 12 states, 11 states have (on average 7.545454545454546) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (21), 6 states have call predecessors, (21), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-11 02:47:40,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:47:40,470 INFO L93 Difference]: Finished difference Result 877 states and 1415 transitions. [2024-10-11 02:47:40,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:47:40,472 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.545454545454546) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (21), 6 states have call predecessors, (21), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 135 [2024-10-11 02:47:40,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:47:40,475 INFO L225 Difference]: With dead ends: 877 [2024-10-11 02:47:40,475 INFO L226 Difference]: Without dead ends: 492 [2024-10-11 02:47:40,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:47:40,477 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 1135 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 3579 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 3970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 3579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:47:40,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 1597 Invalid, 3970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 3579 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 02:47:40,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2024-10-11 02:47:40,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 410. [2024-10-11 02:47:40,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 312 states have (on average 1.6121794871794872) internal successors, (503), 319 states have internal predecessors, (503), 70 states have call successors, (70), 24 states have call predecessors, (70), 27 states have return successors, (79), 66 states have call predecessors, (79), 67 states have call successors, (79) [2024-10-11 02:47:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 652 transitions. [2024-10-11 02:47:40,499 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 652 transitions. Word has length 135 [2024-10-11 02:47:40,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:47:40,499 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 652 transitions. [2024-10-11 02:47:40,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.545454545454546) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (21), 6 states have call predecessors, (21), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-11 02:47:40,499 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 652 transitions. [2024-10-11 02:47:40,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 02:47:40,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:47:40,501 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:47:40,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:47:40,501 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:47:40,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:47:40,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1568763899, now seen corresponding path program 1 times [2024-10-11 02:47:40,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:47:40,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886761339] [2024-10-11 02:47:40,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:40,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:47:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:40,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:47:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:40,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:47:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:40,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:47:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:40,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:47:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:40,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:47:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:40,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:47:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:40,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:47:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:40,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:47:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:40,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:47:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:40,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:47:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:40,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:47:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:40,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:47:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:40,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:47:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:40,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:47:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:40,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 02:47:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:40,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 02:47:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:40,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 02:47:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 02:47:40,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:47:40,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886761339] [2024-10-11 02:47:40,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886761339] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:47:40,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448675331] [2024-10-11 02:47:40,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:40,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:47:40,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:47:40,666 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:47:40,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 02:47:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:40,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:47:40,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:47:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 02:47:41,013 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:47:41,115 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 02:47:41,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448675331] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:47:41,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:47:41,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-10-11 02:47:41,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908368840] [2024-10-11 02:47:41,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:47:41,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:47:41,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:47:41,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:47:41,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:47:41,117 INFO L87 Difference]: Start difference. First operand 410 states and 652 transitions. Second operand has 11 states, 11 states have (on average 11.0) internal successors, (121), 7 states have internal predecessors, (121), 2 states have call successors, (42), 6 states have call predecessors, (42), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 02:47:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:47:43,026 INFO L93 Difference]: Finished difference Result 1051 states and 1771 transitions. [2024-10-11 02:47:43,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:47:43,027 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 7 states have internal predecessors, (121), 2 states have call successors, (42), 6 states have call predecessors, (42), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 136 [2024-10-11 02:47:43,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:47:43,039 INFO L225 Difference]: With dead ends: 1051 [2024-10-11 02:47:43,044 INFO L226 Difference]: Without dead ends: 892 [2024-10-11 02:47:43,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:47:43,046 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 1493 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 2848 mSolverCounterSat, 536 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 3384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 536 IncrementalHoareTripleChecker+Valid, 2848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:47:43,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1547 Valid, 1693 Invalid, 3384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [536 Valid, 2848 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 02:47:43,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2024-10-11 02:47:43,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 795. [2024-10-11 02:47:43,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 618 states have (on average 1.6634304207119741) internal successors, (1028), 625 states have internal predecessors, (1028), 149 states have call successors, (149), 24 states have call predecessors, (149), 27 states have return successors, (168), 145 states have call predecessors, (168), 146 states have call successors, (168) [2024-10-11 02:47:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1345 transitions. [2024-10-11 02:47:43,137 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1345 transitions. Word has length 136 [2024-10-11 02:47:43,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:47:43,138 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1345 transitions. [2024-10-11 02:47:43,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 7 states have internal predecessors, (121), 2 states have call successors, (42), 6 states have call predecessors, (42), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 02:47:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1345 transitions. [2024-10-11 02:47:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 02:47:43,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:47:43,143 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:47:43,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 02:47:43,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 02:47:43,344 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:47:43,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:47:43,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1400307165, now seen corresponding path program 1 times [2024-10-11 02:47:43,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:47:43,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952065182] [2024-10-11 02:47:43,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:43,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:47:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:43,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:47:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:43,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:47:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:43,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:47:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:43,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:47:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:43,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:47:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:43,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:47:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:43,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:47:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:43,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:47:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:43,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:47:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:43,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:47:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:43,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:47:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:43,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:47:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:43,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:47:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:43,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 02:47:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:43,548 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-11 02:47:43,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:47:43,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952065182] [2024-10-11 02:47:43,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952065182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:47:43,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:47:43,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:47:43,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595117595] [2024-10-11 02:47:43,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:47:43,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:47:43,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:47:43,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:47:43,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:47:43,555 INFO L87 Difference]: Start difference. First operand 795 states and 1345 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:47:45,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:47:45,520 INFO L93 Difference]: Finished difference Result 1999 states and 3466 transitions. [2024-10-11 02:47:45,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:47:45,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 124 [2024-10-11 02:47:45,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:47:45,543 INFO L225 Difference]: With dead ends: 1999 [2024-10-11 02:47:45,543 INFO L226 Difference]: Without dead ends: 1264 [2024-10-11 02:47:45,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11 02:47:45,552 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1253 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:47:45,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 863 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 02:47:45,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2024-10-11 02:47:45,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1177. [2024-10-11 02:47:45,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 921 states have (on average 1.6720955483170468) internal successors, (1540), 928 states have internal predecessors, (1540), 228 states have call successors, (228), 24 states have call predecessors, (228), 27 states have return successors, (257), 224 states have call predecessors, (257), 225 states have call successors, (257) [2024-10-11 02:47:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 2025 transitions. [2024-10-11 02:47:45,683 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 2025 transitions. Word has length 124 [2024-10-11 02:47:45,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:47:45,684 INFO L471 AbstractCegarLoop]: Abstraction has 1177 states and 2025 transitions. [2024-10-11 02:47:45,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:47:45,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 2025 transitions. [2024-10-11 02:47:45,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 02:47:45,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:47:45,689 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:47:45,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:47:45,690 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:47:45,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:47:45,690 INFO L85 PathProgramCache]: Analyzing trace with hash 472709356, now seen corresponding path program 1 times [2024-10-11 02:47:45,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:47:45,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627201230] [2024-10-11 02:47:45,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:45,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:47:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:45,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:47:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:45,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:47:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:45,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:47:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:45,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:47:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:45,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:47:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:45,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:47:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:45,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:47:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:45,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:47:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:45,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:47:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:45,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:47:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:45,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:47:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:45,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:47:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:45,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:47:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:45,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:47:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:45,831 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-11 02:47:45,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:47:45,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627201230] [2024-10-11 02:47:45,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627201230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:47:45,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:47:45,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:47:45,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889643015] [2024-10-11 02:47:45,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:47:45,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:47:45,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:47:45,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:47:45,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:47:45,833 INFO L87 Difference]: Start difference. First operand 1177 states and 2025 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:47:47,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:47:47,285 INFO L93 Difference]: Finished difference Result 2930 states and 5122 transitions. [2024-10-11 02:47:47,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:47:47,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-10-11 02:47:47,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:47:47,298 INFO L225 Difference]: With dead ends: 2930 [2024-10-11 02:47:47,298 INFO L226 Difference]: Without dead ends: 1863 [2024-10-11 02:47:47,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11 02:47:47,304 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1250 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:47:47,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 843 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:47:47,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2024-10-11 02:47:47,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1776. [2024-10-11 02:47:47,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1401 states have (on average 1.6773733047822983) internal successors, (2350), 1408 states have internal predecessors, (2350), 347 states have call successors, (347), 24 states have call predecessors, (347), 27 states have return successors, (376), 343 states have call predecessors, (376), 344 states have call successors, (376) [2024-10-11 02:47:47,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 3073 transitions. [2024-10-11 02:47:47,385 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 3073 transitions. Word has length 125 [2024-10-11 02:47:47,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:47:47,386 INFO L471 AbstractCegarLoop]: Abstraction has 1776 states and 3073 transitions. [2024-10-11 02:47:47,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:47:47,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 3073 transitions. [2024-10-11 02:47:47,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 02:47:47,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:47:47,397 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:47:47,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:47:47,398 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:47:47,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:47:47,398 INFO L85 PathProgramCache]: Analyzing trace with hash 12435430, now seen corresponding path program 1 times [2024-10-11 02:47:47,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:47:47,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149546531] [2024-10-11 02:47:47,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:47,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:47:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:47,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:47:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:47,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:47:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:47,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:47:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:47,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:47:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:47,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:47:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:47,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:47:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:47,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:47:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:47,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:47:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:47,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:47:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:47,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:47:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:47,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:47:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:47,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:47:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:47,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:47:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:47,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:47:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:47,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 02:47:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:47,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 02:47:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:47,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 02:47:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:47,606 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 02:47:47,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:47:47,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149546531] [2024-10-11 02:47:47,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149546531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:47:47,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:47:47,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:47:47,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046024602] [2024-10-11 02:47:47,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:47:47,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:47:47,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:47:47,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:47:47,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:47:47,610 INFO L87 Difference]: Start difference. First operand 1776 states and 3073 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 02:47:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:47:49,015 INFO L93 Difference]: Finished difference Result 4326 states and 7627 transitions. [2024-10-11 02:47:49,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:47:49,015 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 144 [2024-10-11 02:47:49,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:47:49,029 INFO L225 Difference]: With dead ends: 4326 [2024-10-11 02:47:49,029 INFO L226 Difference]: Without dead ends: 2780 [2024-10-11 02:47:49,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 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-11 02:47:49,035 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 1249 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:47:49,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 843 Invalid, 1638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:47:49,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2780 states. [2024-10-11 02:47:49,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 2693. [2024-10-11 02:47:49,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2693 states, 2156 states have (on average 1.6822820037105752) internal successors, (3627), 2163 states have internal predecessors, (3627), 509 states have call successors, (509), 24 states have call predecessors, (509), 27 states have return successors, (554), 505 states have call predecessors, (554), 506 states have call successors, (554) [2024-10-11 02:47:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 4690 transitions. [2024-10-11 02:47:49,155 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 4690 transitions. Word has length 144 [2024-10-11 02:47:49,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:47:49,156 INFO L471 AbstractCegarLoop]: Abstraction has 2693 states and 4690 transitions. [2024-10-11 02:47:49,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 02:47:49,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 4690 transitions. [2024-10-11 02:47:49,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 02:47:49,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:47:49,168 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:47:49,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:47:49,168 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:47:49,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:47:49,169 INFO L85 PathProgramCache]: Analyzing trace with hash -361848181, now seen corresponding path program 1 times [2024-10-11 02:47:49,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:47:49,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013139922] [2024-10-11 02:47:49,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:49,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:47:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:49,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:47:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:49,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:47:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:49,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:47:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:49,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:47:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:49,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:47:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:49,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:47:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:49,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:47:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:49,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:47:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:49,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:47:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:49,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:47:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:49,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:47:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:49,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:47:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:49,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 02:47:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:49,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 02:47:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:49,282 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-11 02:47:49,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:47:49,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013139922] [2024-10-11 02:47:49,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013139922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:47:49,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:47:49,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:47:49,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355368895] [2024-10-11 02:47:49,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:47:49,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:47:49,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:47:49,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:47:49,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:47:49,284 INFO L87 Difference]: Start difference. First operand 2693 states and 4690 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:47:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:47:50,357 INFO L93 Difference]: Finished difference Result 6526 states and 11587 transitions. [2024-10-11 02:47:50,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:47:50,357 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 127 [2024-10-11 02:47:50,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:47:50,379 INFO L225 Difference]: With dead ends: 6526 [2024-10-11 02:47:50,379 INFO L226 Difference]: Without dead ends: 4260 [2024-10-11 02:47:50,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11 02:47:50,390 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 1242 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 428 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 428 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:47:50,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1260 Valid, 843 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [428 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:47:50,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4260 states. [2024-10-11 02:47:50,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4260 to 4173. [2024-10-11 02:47:50,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4173 states, 3391 states have (on average 1.6859333529932174) internal successors, (5717), 3398 states have internal predecessors, (5717), 754 states have call successors, (754), 24 states have call predecessors, (754), 27 states have return successors, (825), 750 states have call predecessors, (825), 751 states have call successors, (825) [2024-10-11 02:47:50,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4173 states to 4173 states and 7296 transitions. [2024-10-11 02:47:50,580 INFO L78 Accepts]: Start accepts. Automaton has 4173 states and 7296 transitions. Word has length 127 [2024-10-11 02:47:50,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:47:50,581 INFO L471 AbstractCegarLoop]: Abstraction has 4173 states and 7296 transitions. [2024-10-11 02:47:50,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:47:50,581 INFO L276 IsEmpty]: Start isEmpty. Operand 4173 states and 7296 transitions. [2024-10-11 02:47:50,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 02:47:50,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:47:50,595 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:47:50,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:47:50,595 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:47:50,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:47:50,596 INFO L85 PathProgramCache]: Analyzing trace with hash -34620603, now seen corresponding path program 1 times [2024-10-11 02:47:50,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:47:50,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641399174] [2024-10-11 02:47:50,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:50,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:47:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:50,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:47:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:50,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:47:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:50,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:47:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:50,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:47:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:50,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:47:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:50,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:47:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:50,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:47:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:50,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:47:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:50,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:47:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:50,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:47:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:50,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:47:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:50,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:47:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:50,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:47:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:50,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 02:47:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:50,710 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-11 02:47:50,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:47:50,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641399174] [2024-10-11 02:47:50,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641399174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:47:50,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:47:50,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:47:50,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105597775] [2024-10-11 02:47:50,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:47:50,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:47:50,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:47:50,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:47:50,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:47:50,711 INFO L87 Difference]: Start difference. First operand 4173 states and 7296 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:47:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:47:52,472 INFO L93 Difference]: Finished difference Result 10455 states and 18612 transitions. [2024-10-11 02:47:52,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:47:52,473 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2024-10-11 02:47:52,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:47:52,511 INFO L225 Difference]: With dead ends: 10455 [2024-10-11 02:47:52,511 INFO L226 Difference]: Without dead ends: 6932 [2024-10-11 02:47:52,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11 02:47:52,526 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 1248 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 455 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:47:52,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 877 Invalid, 1658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [455 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 02:47:52,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6932 states. [2024-10-11 02:47:52,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6932 to 6845. [2024-10-11 02:47:52,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6845 states, 5570 states have (on average 1.6806104129263915) internal successors, (9361), 5577 states have internal predecessors, (9361), 1247 states have call successors, (1247), 24 states have call predecessors, (1247), 27 states have return successors, (1362), 1243 states have call predecessors, (1362), 1244 states have call successors, (1362) [2024-10-11 02:47:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6845 states to 6845 states and 11970 transitions. [2024-10-11 02:47:52,727 INFO L78 Accepts]: Start accepts. Automaton has 6845 states and 11970 transitions. Word has length 128 [2024-10-11 02:47:52,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:47:52,727 INFO L471 AbstractCegarLoop]: Abstraction has 6845 states and 11970 transitions. [2024-10-11 02:47:52,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:47:52,728 INFO L276 IsEmpty]: Start isEmpty. Operand 6845 states and 11970 transitions. [2024-10-11 02:47:52,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 02:47:52,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:47:52,746 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:47:52,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:47:52,746 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:47:52,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:47:52,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1162983852, now seen corresponding path program 1 times [2024-10-11 02:47:52,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:47:52,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232192209] [2024-10-11 02:47:52,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:52,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:47:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:52,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:47:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:52,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:47:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:52,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:47:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:52,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:47:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:52,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:47:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:52,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:47:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:52,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:47:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:52,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:47:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:52,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:47:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:52,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:47:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:52,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:47:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:52,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:47:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:52,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:47:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:52,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 02:47:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:52,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 02:47:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:52,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 02:47:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:52,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 02:47:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:52,892 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 02:47:52,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:47:52,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232192209] [2024-10-11 02:47:52,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232192209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:47:52,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:47:52,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:47:52,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451999352] [2024-10-11 02:47:52,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:47:52,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:47:52,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:47:52,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:47:52,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:47:52,894 INFO L87 Difference]: Start difference. First operand 6845 states and 11970 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 02:47:54,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:47:54,474 INFO L93 Difference]: Finished difference Result 17434 states and 31023 transitions. [2024-10-11 02:47:54,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:47:54,474 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 147 [2024-10-11 02:47:54,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:47:54,553 INFO L225 Difference]: With dead ends: 17434 [2024-10-11 02:47:54,553 INFO L226 Difference]: Without dead ends: 11605 [2024-10-11 02:47:54,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 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-11 02:47:54,573 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1238 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:47:54,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 856 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 02:47:54,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11605 states. [2024-10-11 02:47:54,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11605 to 11518. [2024-10-11 02:47:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11518 states, 9421 states have (on average 1.680076425007961) internal successors, (15828), 9428 states have internal predecessors, (15828), 2069 states have call successors, (2069), 24 states have call predecessors, (2069), 27 states have return successors, (2262), 2065 states have call predecessors, (2262), 2066 states have call successors, (2262) [2024-10-11 02:47:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11518 states to 11518 states and 20159 transitions. [2024-10-11 02:47:55,193 INFO L78 Accepts]: Start accepts. Automaton has 11518 states and 20159 transitions. Word has length 147 [2024-10-11 02:47:55,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:47:55,193 INFO L471 AbstractCegarLoop]: Abstraction has 11518 states and 20159 transitions. [2024-10-11 02:47:55,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 02:47:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 11518 states and 20159 transitions. [2024-10-11 02:47:55,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 02:47:55,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:47:55,228 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:47:55,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:47:55,228 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:47:55,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:47:55,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1094289064, now seen corresponding path program 1 times [2024-10-11 02:47:55,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:47:55,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255918709] [2024-10-11 02:47:55,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:55,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:47:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:55,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:47:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:55,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:47:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:55,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:47:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:55,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:47:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:55,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:47:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:55,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:47:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:55,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:47:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:55,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:47:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:55,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:47:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:55,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:47:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:55,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:47:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:55,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:47:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:55,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 02:47:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:55,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 02:47:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:55,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 02:47:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:55,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 02:47:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:55,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 02:47:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 02:47:55,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:47:55,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255918709] [2024-10-11 02:47:55,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255918709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:47:55,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:47:55,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:47:55,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085503033] [2024-10-11 02:47:55,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:47:55,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:47:55,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:47:55,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:47:55,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:47:55,350 INFO L87 Difference]: Start difference. First operand 11518 states and 20159 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 02:47:56,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:47:56,982 INFO L93 Difference]: Finished difference Result 27560 states and 48841 transitions. [2024-10-11 02:47:56,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:47:56,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 148 [2024-10-11 02:47:56,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:47:57,060 INFO L225 Difference]: With dead ends: 27560 [2024-10-11 02:47:57,060 INFO L226 Difference]: Without dead ends: 17989 [2024-10-11 02:47:57,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 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-11 02:47:57,096 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 1236 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 1652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:47:57,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 818 Invalid, 1652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 02:47:57,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17989 states. [2024-10-11 02:47:58,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17989 to 17902. [2024-10-11 02:47:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17902 states, 14602 states have (on average 1.656279961649089) internal successors, (24185), 14609 states have internal predecessors, (24185), 3272 states have call successors, (3272), 24 states have call predecessors, (3272), 27 states have return successors, (3609), 3268 states have call predecessors, (3609), 3269 states have call successors, (3609) [2024-10-11 02:47:58,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17902 states to 17902 states and 31066 transitions. [2024-10-11 02:47:58,554 INFO L78 Accepts]: Start accepts. Automaton has 17902 states and 31066 transitions. Word has length 148 [2024-10-11 02:47:58,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:47:58,559 INFO L471 AbstractCegarLoop]: Abstraction has 17902 states and 31066 transitions. [2024-10-11 02:47:58,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 02:47:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 17902 states and 31066 transitions. [2024-10-11 02:47:58,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 02:47:58,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:47:58,625 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:47:58,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 02:47:58,626 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:47:58,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:47:58,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1681680922, now seen corresponding path program 1 times [2024-10-11 02:47:58,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:47:58,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191904941] [2024-10-11 02:47:58,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:47:58,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:47:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:58,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:47:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:58,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:47:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:58,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:47:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:58,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:47:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:58,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:47:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:58,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:47:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:58,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:47:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:58,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:47:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:58,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:47:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:58,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:47:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:58,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:47:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:58,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:47:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:58,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:47:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:58,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 02:47:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:47:58,803 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-11 02:47:58,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:47:58,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191904941] [2024-10-11 02:47:58,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191904941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:47:58,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:47:58,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:47:58,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714556392] [2024-10-11 02:47:58,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:47:58,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:47:58,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:47:58,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:47:58,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:47:58,807 INFO L87 Difference]: Start difference. First operand 17902 states and 31066 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:48:00,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:48:00,970 INFO L93 Difference]: Finished difference Result 47385 states and 83748 transitions. [2024-10-11 02:48:00,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:48:00,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 131 [2024-10-11 02:48:00,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:48:01,111 INFO L225 Difference]: With dead ends: 47385 [2024-10-11 02:48:01,112 INFO L226 Difference]: Without dead ends: 32022 [2024-10-11 02:48:01,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11 02:48:01,170 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 1237 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:48:01,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 844 Invalid, 1658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 02:48:01,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32022 states. [2024-10-11 02:48:02,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32022 to 31935. [2024-10-11 02:48:02,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31935 states, 26185 states have (on average 1.6531983960282604) internal successors, (43289), 26192 states have internal predecessors, (43289), 5722 states have call successors, (5722), 24 states have call predecessors, (5722), 27 states have return successors, (6333), 5718 states have call predecessors, (6333), 5719 states have call successors, (6333) [2024-10-11 02:48:02,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31935 states to 31935 states and 55344 transitions. [2024-10-11 02:48:02,707 INFO L78 Accepts]: Start accepts. Automaton has 31935 states and 55344 transitions. Word has length 131 [2024-10-11 02:48:02,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:48:02,710 INFO L471 AbstractCegarLoop]: Abstraction has 31935 states and 55344 transitions. [2024-10-11 02:48:02,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:48:02,711 INFO L276 IsEmpty]: Start isEmpty. Operand 31935 states and 55344 transitions. [2024-10-11 02:48:02,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 02:48:02,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:48:02,756 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:48:02,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 02:48:02,756 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:48:02,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:48:02,757 INFO L85 PathProgramCache]: Analyzing trace with hash -815949207, now seen corresponding path program 1 times [2024-10-11 02:48:02,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:48:02,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044527611] [2024-10-11 02:48:02,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:48:02,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:48:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:02,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:48:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:02,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:48:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:02,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:48:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:02,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:48:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:02,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:48:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:02,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:48:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:02,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:48:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:02,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:48:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:02,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:48:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:02,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:48:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:02,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:48:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:02,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:48:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:02,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 02:48:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:02,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 02:48:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:02,899 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-11 02:48:02,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:48:02,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044527611] [2024-10-11 02:48:02,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044527611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:48:02,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:48:02,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:48:02,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117287167] [2024-10-11 02:48:02,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:48:02,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:48:02,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:48:02,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:48:02,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:48:02,903 INFO L87 Difference]: Start difference. First operand 31935 states and 55344 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:48:05,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:48:05,868 INFO L93 Difference]: Finished difference Result 87107 states and 153207 transitions. [2024-10-11 02:48:05,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:48:05,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2024-10-11 02:48:05,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:48:06,082 INFO L225 Difference]: With dead ends: 87107 [2024-10-11 02:48:06,083 INFO L226 Difference]: Without dead ends: 58570 [2024-10-11 02:48:06,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-11 02:48:06,161 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 1237 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:48:06,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 844 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:48:06,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58570 states. [2024-10-11 02:48:08,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58570 to 58483. [2024-10-11 02:48:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58483 states, 48220 states have (on average 1.649170468685193) internal successors, (79523), 48227 states have internal predecessors, (79523), 10235 states have call successors, (10235), 24 states have call predecessors, (10235), 27 states have return successors, (11378), 10231 states have call predecessors, (11378), 10232 states have call successors, (11378) [2024-10-11 02:48:09,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58483 states to 58483 states and 101136 transitions. [2024-10-11 02:48:09,449 INFO L78 Accepts]: Start accepts. Automaton has 58483 states and 101136 transitions. Word has length 132 [2024-10-11 02:48:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:48:09,450 INFO L471 AbstractCegarLoop]: Abstraction has 58483 states and 101136 transitions. [2024-10-11 02:48:09,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:48:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 58483 states and 101136 transitions. [2024-10-11 02:48:09,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 02:48:09,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:48:09,487 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:48:09,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 02:48:09,488 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:48:09,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:48:09,488 INFO L85 PathProgramCache]: Analyzing trace with hash 196666342, now seen corresponding path program 1 times [2024-10-11 02:48:09,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:48:09,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305268375] [2024-10-11 02:48:09,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:48:09,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:48:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:09,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:48:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:09,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:48:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:09,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:48:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:09,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:48:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:09,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:48:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:09,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:48:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:09,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:48:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:09,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:48:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:09,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:48:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:09,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:48:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:09,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:48:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:09,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:48:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:09,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 02:48:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:09,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 02:48:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:09,974 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-11 02:48:09,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:48:09,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305268375] [2024-10-11 02:48:09,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305268375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:48:09,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:48:09,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:48:09,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056332076] [2024-10-11 02:48:09,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:48:09,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:48:09,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:48:09,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:48:09,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:48:09,976 INFO L87 Difference]: Start difference. First operand 58483 states and 101136 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:48:14,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:48:14,249 INFO L93 Difference]: Finished difference Result 109431 states and 193018 transitions. [2024-10-11 02:48:14,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:48:14,252 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 133 [2024-10-11 02:48:14,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:48:14,815 INFO L225 Difference]: With dead ends: 109431 [2024-10-11 02:48:14,815 INFO L226 Difference]: Without dead ends: 109272 [2024-10-11 02:48:14,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:48:14,851 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1232 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:48:14,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 852 Invalid, 1657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 02:48:14,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109272 states. [2024-10-11 02:48:18,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109272 to 109185. [2024-10-11 02:48:18,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109185 states, 90554 states have (on average 1.644035603065574) internal successors, (148874), 90561 states have internal predecessors, (148874), 18603 states have call successors, (18603), 24 states have call predecessors, (18603), 27 states have return successors, (20792), 18599 states have call predecessors, (20792), 18600 states have call successors, (20792) [2024-10-11 02:48:20,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109185 states to 109185 states and 188269 transitions. [2024-10-11 02:48:20,105 INFO L78 Accepts]: Start accepts. Automaton has 109185 states and 188269 transitions. Word has length 133 [2024-10-11 02:48:20,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:48:20,106 INFO L471 AbstractCegarLoop]: Abstraction has 109185 states and 188269 transitions. [2024-10-11 02:48:20,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:48:20,106 INFO L276 IsEmpty]: Start isEmpty. Operand 109185 states and 188269 transitions. [2024-10-11 02:48:20,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 02:48:20,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:48:20,147 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:48:20,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 02:48:20,148 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:48:20,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:48:20,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1079723281, now seen corresponding path program 1 times [2024-10-11 02:48:20,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:48:20,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796237697] [2024-10-11 02:48:20,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:48:20,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:48:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:20,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:48:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:20,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:48:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:20,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:48:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:20,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:48:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:20,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:48:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:20,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:48:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:20,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:48:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:20,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:48:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:20,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:48:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:20,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:48:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:20,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:48:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:20,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:48:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:20,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 02:48:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:20,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 02:48:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:20,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 02:48:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:20,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 02:48:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:20,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 02:48:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:20,321 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 02:48:20,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:48:20,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796237697] [2024-10-11 02:48:20,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796237697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:48:20,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:48:20,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:48:20,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035779783] [2024-10-11 02:48:20,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:48:20,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:48:20,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:48:20,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:48:20,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:48:20,327 INFO L87 Difference]: Start difference. First operand 109185 states and 188269 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 02:48:28,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:48:28,531 INFO L93 Difference]: Finished difference Result 210327 states and 370480 transitions. [2024-10-11 02:48:28,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 02:48:28,532 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 152 [2024-10-11 02:48:28,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:48:29,465 INFO L225 Difference]: With dead ends: 210327 [2024-10-11 02:48:29,466 INFO L226 Difference]: Without dead ends: 210175 [2024-10-11 02:48:29,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2024-10-11 02:48:29,566 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 2553 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 2725 mSolverCounterSat, 824 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2571 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 3549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 824 IncrementalHoareTripleChecker+Valid, 2725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:48:29,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2571 Valid, 1510 Invalid, 3549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [824 Valid, 2725 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 02:48:29,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210175 states. [2024-10-11 02:48:37,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210175 to 210003. [2024-10-11 02:48:38,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210003 states, 174246 states have (on average 1.6474237572168084) internal successors, (287057), 174199 states have internal predecessors, (287057), 35706 states have call successors, (35706), 46 states have call predecessors, (35706), 50 states have return successors, (38987), 35757 states have call predecessors, (38987), 35702 states have call successors, (38987) [2024-10-11 02:48:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210003 states to 210003 states and 361750 transitions. [2024-10-11 02:48:38,899 INFO L78 Accepts]: Start accepts. Automaton has 210003 states and 361750 transitions. Word has length 152 [2024-10-11 02:48:38,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:48:38,900 INFO L471 AbstractCegarLoop]: Abstraction has 210003 states and 361750 transitions. [2024-10-11 02:48:38,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 02:48:38,900 INFO L276 IsEmpty]: Start isEmpty. Operand 210003 states and 361750 transitions. [2024-10-11 02:48:38,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 02:48:38,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:48:38,977 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:48:38,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 02:48:38,977 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:48:38,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:48:38,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1266387879, now seen corresponding path program 1 times [2024-10-11 02:48:38,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:48:38,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003415689] [2024-10-11 02:48:38,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:48:38,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:48:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:39,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:48:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:39,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:48:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:39,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:48:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:39,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:48:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:39,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:48:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:39,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:48:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:39,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:48:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:39,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:48:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:39,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:48:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:39,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:48:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:39,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:48:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:40,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:48:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:40,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 02:48:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:40,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 02:48:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:40,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 02:48:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:40,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 02:48:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:40,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 02:48:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:48:40,021 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 02:48:40,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:48:40,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003415689] [2024-10-11 02:48:40,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003415689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:48:40,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:48:40,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 02:48:40,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724975341] [2024-10-11 02:48:40,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:48:40,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 02:48:40,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:48:40,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 02:48:40,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:48:40,029 INFO L87 Difference]: Start difference. First operand 210003 states and 361750 transitions. Second operand has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (21), 8 states have call predecessors, (21), 2 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-11 02:48:48,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:48:48,005 INFO L93 Difference]: Finished difference Result 210540 states and 368857 transitions. [2024-10-11 02:48:48,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 02:48:48,006 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (21), 8 states have call predecessors, (21), 2 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 153 [2024-10-11 02:48:48,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted.