./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_product24.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product24.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d6572e4842c262533bee65d100c3a8328a4505c101a30c259390a3fe459f824d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:57:28,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:57:28,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:57:28,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:57:28,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:57:28,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:57:28,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:57:28,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:57:28,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:57:28,174 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:57:28,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:57:28,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:57:28,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:57:28,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:57:28,178 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:57:28,179 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:57:28,179 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:57:28,179 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:57:28,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:57:28,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:57:28,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:57:28,184 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:57:28,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:57:28,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:57:28,185 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:57:28,185 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:57:28,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:57:28,186 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:57:28,186 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:57:28,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:57:28,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:57:28,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:57:28,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:57:28,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:57:28,187 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:57:28,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:57:28,188 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:57:28,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:57:28,190 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:57:28,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:57:28,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:57:28,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:57:28,191 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d6572e4842c262533bee65d100c3a8328a4505c101a30c259390a3fe459f824d [2024-10-14 02:57:28,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:57:28,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:57:28,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:57:28,458 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:57:28,459 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:57:28,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product24.cil.c [2024-10-14 02:57:29,921 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:57:30,219 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:57:30,221 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product24.cil.c [2024-10-14 02:57:30,248 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f7818176/a89e9f78217546c2aec15a92e2c5dbb2/FLAG410942f49 [2024-10-14 02:57:30,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f7818176/a89e9f78217546c2aec15a92e2c5dbb2 [2024-10-14 02:57:30,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:57:30,509 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:57:30,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:57:30,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:57:30,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:57:30,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:57:30" (1/1) ... [2024-10-14 02:57:30,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a47cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:57:30, skipping insertion in model container [2024-10-14 02:57:30,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:57:30" (1/1) ... [2024-10-14 02:57:30,594 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:57:31,056 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_product24.cil.c[52737,52750] [2024-10-14 02:57:31,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:57:31,130 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:57:31,139 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2024-10-14 02:57:31,141 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [97] [2024-10-14 02:57:31,141 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [410] [2024-10-14 02:57:31,141 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [517] [2024-10-14 02:57:31,141 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1588] [2024-10-14 02:57:31,142 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1807] [2024-10-14 02:57:31,142 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2211] [2024-10-14 02:57:31,142 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2536] [2024-10-14 02:57:31,143 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2545] [2024-10-14 02:57:31,143 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2911] [2024-10-14 02:57:31,144 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [2928] [2024-10-14 02:57:31,272 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_product24.cil.c[52737,52750] [2024-10-14 02:57:31,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:57:31,326 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:57:31,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:57:31 WrapperNode [2024-10-14 02:57:31,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:57:31,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:57:31,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:57:31,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:57:31,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:57:31" (1/1) ... [2024-10-14 02:57:31,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:57:31" (1/1) ... [2024-10-14 02:57:31,417 INFO L138 Inliner]: procedures = 131, calls = 200, calls flagged for inlining = 62, calls inlined = 57, statements flattened = 1029 [2024-10-14 02:57:31,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:57:31,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:57:31,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:57:31,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:57:31,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:57:31" (1/1) ... [2024-10-14 02:57:31,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:57:31" (1/1) ... [2024-10-14 02:57:31,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:57:31" (1/1) ... [2024-10-14 02:57:31,458 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-14 02:57:31,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:57:31" (1/1) ... [2024-10-14 02:57:31,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:57:31" (1/1) ... [2024-10-14 02:57:31,475 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:57:31" (1/1) ... [2024-10-14 02:57:31,483 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:57:31" (1/1) ... [2024-10-14 02:57:31,488 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:57:31" (1/1) ... [2024-10-14 02:57:31,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:57:31" (1/1) ... [2024-10-14 02:57:31,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:57:31,502 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:57:31,502 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:57:31,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:57:31,503 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:57:31" (1/1) ... [2024-10-14 02:57:31,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:57:31,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:57:31,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 02:57:31,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 02:57:31,627 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-14 02:57:31,627 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-14 02:57:31,627 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-14 02:57:31,627 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-14 02:57:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-14 02:57:31,628 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-14 02:57:31,628 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-14 02:57:31,629 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-14 02:57:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-14 02:57:31,629 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-14 02:57:31,629 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-14 02:57:31,630 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-14 02:57:31,630 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-14 02:57:31,630 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-14 02:57:31,631 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2024-10-14 02:57:31,631 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2024-10-14 02:57:31,631 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-14 02:57:31,631 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-14 02:57:31,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:57:31,631 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-14 02:57:31,632 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-14 02:57:31,633 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-14 02:57:31,633 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-14 02:57:31,633 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-14 02:57:31,633 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-14 02:57:31,633 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-14 02:57:31,634 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-14 02:57:31,634 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-14 02:57:31,634 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-14 02:57:31,634 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-14 02:57:31,635 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-14 02:57:31,635 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-10-14 02:57:31,635 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-10-14 02:57:31,635 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-14 02:57:31,636 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-14 02:57:31,636 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-14 02:57:31,636 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-14 02:57:31,636 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-14 02:57:31,636 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-14 02:57:31,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:57:31,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 02:57:31,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 02:57:31,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 02:57:31,637 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-14 02:57:31,637 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-14 02:57:31,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:57:31,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:57:31,864 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:57:31,866 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:57:32,763 INFO L? ?]: Removed 457 outVars from TransFormulas that were not future-live. [2024-10-14 02:57:32,763 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:57:32,820 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:57:32,820 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:57:32,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:57:32 BoogieIcfgContainer [2024-10-14 02:57:32,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:57:32,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:57:32,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:57:32,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:57:32,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:57:30" (1/3) ... [2024-10-14 02:57:32,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@463d48b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:57:32, skipping insertion in model container [2024-10-14 02:57:32,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:57:31" (2/3) ... [2024-10-14 02:57:32,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@463d48b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:57:32, skipping insertion in model container [2024-10-14 02:57:32,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:57:32" (3/3) ... [2024-10-14 02:57:32,829 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec3_product24.cil.c [2024-10-14 02:57:32,844 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:57:32,844 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:57:32,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:57:32,926 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;@5503e969, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:57:32,926 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:57:32,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 313 states, 237 states have (on average 1.5822784810126582) internal successors, (375), 241 states have internal predecessors, (375), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-14 02:57:32,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 02:57:32,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:57:32,950 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] [2024-10-14 02:57:32,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:57:32,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:57:32,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1175324009, now seen corresponding path program 1 times [2024-10-14 02:57:32,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:57:32,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576041367] [2024-10-14 02:57:32,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:57:32,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:57:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:33,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:57:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:33,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:57:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:33,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:57:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:33,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:57:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:33,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:57:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:33,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:57:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:33,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 02:57:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:33,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 02:57:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:33,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 02:57:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:33,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 02:57:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:33,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 02:57:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:33,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 02:57:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:33,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 02:57:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:33,791 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-14 02:57:33,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:57:33,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576041367] [2024-10-14 02:57:33,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576041367] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:57:33,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033343596] [2024-10-14 02:57:33,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:57:33,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:57:33,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:57:33,796 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:57:33,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 02:57:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:34,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 02:57:34,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:57:34,184 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-14 02:57:34,185 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:57:34,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033343596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:57:34,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:57:34,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-14 02:57:34,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732644134] [2024-10-14 02:57:34,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:57:34,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 02:57:34,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:57:34,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 02:57:34,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:57:34,227 INFO L87 Difference]: Start difference. First operand has 313 states, 237 states have (on average 1.5822784810126582) internal successors, (375), 241 states have internal predecessors, (375), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:57:34,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:57:34,334 INFO L93 Difference]: Finished difference Result 476 states and 722 transitions. [2024-10-14 02:57:34,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 02:57:34,337 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 96 [2024-10-14 02:57:34,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:57:34,350 INFO L225 Difference]: With dead ends: 476 [2024-10-14 02:57:34,350 INFO L226 Difference]: Without dead ends: 309 [2024-10-14 02:57:34,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 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-14 02:57:34,358 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:57:34,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 459 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:57:34,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-14 02:57:34,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-10-14 02:57:34,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 235 states have (on average 1.5659574468085107) internal successors, (368), 237 states have internal predecessors, (368), 54 states have call successors, (54), 20 states have call predecessors, (54), 19 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-14 02:57:34,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 473 transitions. [2024-10-14 02:57:34,416 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 473 transitions. Word has length 96 [2024-10-14 02:57:34,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:57:34,417 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 473 transitions. [2024-10-14 02:57:34,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:57:34,418 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 473 transitions. [2024-10-14 02:57:34,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 02:57:34,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:57:34,422 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] [2024-10-14 02:57:34,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 02:57:34,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-14 02:57:34,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:57:34,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:57:34,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1004144487, now seen corresponding path program 1 times [2024-10-14 02:57:34,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:57:34,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945622660] [2024-10-14 02:57:34,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:57:34,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:57:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:34,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:57:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:34,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:57:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:34,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:57:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:34,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:57:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:34,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:57:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:34,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:57:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:34,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 02:57:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:34,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 02:57:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:34,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 02:57:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:34,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 02:57:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:34,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 02:57:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:34,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 02:57:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:34,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 02:57:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:34,993 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-14 02:57:34,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:57:34,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945622660] [2024-10-14 02:57:34,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945622660] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:57:34,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009398690] [2024-10-14 02:57:34,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:57:34,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:57:34,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:57:34,996 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:57:34,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 02:57:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:35,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 02:57:35,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:57:35,340 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-14 02:57:35,341 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:57:35,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009398690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:57:35,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:57:35,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-14 02:57:35,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13184549] [2024-10-14 02:57:35,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:57:35,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 02:57:35,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:57:35,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 02:57:35,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:57:35,343 INFO L87 Difference]: Start difference. First operand 309 states and 473 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:57:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:57:35,444 INFO L93 Difference]: Finished difference Result 471 states and 705 transitions. [2024-10-14 02:57:35,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 02:57:35,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 97 [2024-10-14 02:57:35,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:57:35,449 INFO L225 Difference]: With dead ends: 471 [2024-10-14 02:57:35,453 INFO L226 Difference]: Without dead ends: 311 [2024-10-14 02:57:35,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 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-14 02:57:35,456 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 0 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:57:35,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 911 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:57:35,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-14 02:57:35,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-10-14 02:57:35,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 237 states have (on average 1.5611814345991561) internal successors, (370), 239 states have internal predecessors, (370), 54 states have call successors, (54), 20 states have call predecessors, (54), 19 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-14 02:57:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 475 transitions. [2024-10-14 02:57:35,499 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 475 transitions. Word has length 97 [2024-10-14 02:57:35,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:57:35,500 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 475 transitions. [2024-10-14 02:57:35,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:57:35,503 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 475 transitions. [2024-10-14 02:57:35,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 02:57:35,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:57:35,508 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] [2024-10-14 02:57:35,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 02:57:35,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-14 02:57:35,709 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:57:35,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:57:35,710 INFO L85 PathProgramCache]: Analyzing trace with hash -365461262, now seen corresponding path program 1 times [2024-10-14 02:57:35,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:57:35,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397382207] [2024-10-14 02:57:35,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:57:35,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:57:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:35,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:57:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:35,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:57:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:35,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:57:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:35,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:57:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:35,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:57:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:35,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:57:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 02:57:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 02:57:36,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 02:57:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 02:57:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 02:57:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 02:57:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 02:57:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,052 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-14 02:57:36,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:57:36,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397382207] [2024-10-14 02:57:36,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397382207] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:57:36,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54498121] [2024-10-14 02:57:36,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:57:36,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:57:36,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:57:36,058 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:57:36,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 02:57:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 02:57:36,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:57:36,382 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-14 02:57:36,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:57:36,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54498121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:57:36,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:57:36,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-14 02:57:36,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090981251] [2024-10-14 02:57:36,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:57:36,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 02:57:36,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:57:36,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 02:57:36,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:57:36,384 INFO L87 Difference]: Start difference. First operand 311 states and 475 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:57:36,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:57:36,452 INFO L93 Difference]: Finished difference Result 656 states and 1016 transitions. [2024-10-14 02:57:36,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 02:57:36,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2024-10-14 02:57:36,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:57:36,456 INFO L225 Difference]: With dead ends: 656 [2024-10-14 02:57:36,458 INFO L226 Difference]: Without dead ends: 367 [2024-10-14 02:57:36,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 125 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-14 02:57:36,461 INFO L432 NwaCegarLoop]: 465 mSDtfsCounter, 109 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:57:36,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 877 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:57:36,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-14 02:57:36,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 362. [2024-10-14 02:57:36,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 277 states have (on average 1.5776173285198556) internal successors, (437), 279 states have internal predecessors, (437), 65 states have call successors, (65), 20 states have call predecessors, (65), 19 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-14 02:57:36,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 564 transitions. [2024-10-14 02:57:36,492 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 564 transitions. Word has length 104 [2024-10-14 02:57:36,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:57:36,492 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 564 transitions. [2024-10-14 02:57:36,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:57:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 564 transitions. [2024-10-14 02:57:36,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 02:57:36,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:57:36,497 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] [2024-10-14 02:57:36,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 02:57:36,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:57:36,698 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:57:36,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:57:36,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1970030430, now seen corresponding path program 1 times [2024-10-14 02:57:36,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:57:36,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159796976] [2024-10-14 02:57:36,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:57:36,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:57:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:57:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:57:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:57:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:57:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:57:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:57:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 02:57:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 02:57:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 02:57:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 02:57:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 02:57:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 02:57:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 02:57:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:36,942 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-14 02:57:36,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:57:36,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159796976] [2024-10-14 02:57:36,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159796976] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:57:36,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585306874] [2024-10-14 02:57:36,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:57:36,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:57:36,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:57:36,945 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:57:36,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 02:57:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:37,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 02:57:37,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:57:37,348 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-14 02:57:37,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:57:37,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585306874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:57:37,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:57:37,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-14 02:57:37,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094895590] [2024-10-14 02:57:37,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:57:37,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:57:37,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:57:37,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:57:37,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:57:37,353 INFO L87 Difference]: Start difference. First operand 362 states and 564 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 02:57:37,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:57:37,470 INFO L93 Difference]: Finished difference Result 719 states and 1122 transitions. [2024-10-14 02:57:37,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 02:57:37,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 105 [2024-10-14 02:57:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:57:37,475 INFO L225 Difference]: With dead ends: 719 [2024-10-14 02:57:37,475 INFO L226 Difference]: Without dead ends: 364 [2024-10-14 02:57:37,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 124 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-14 02:57:37,477 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 2 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:57:37,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1781 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:57:37,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-14 02:57:37,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2024-10-14 02:57:37,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 278 states have (on average 1.5755395683453237) internal successors, (438), 281 states have internal predecessors, (438), 65 states have call successors, (65), 20 states have call predecessors, (65), 20 states have return successors, (64), 62 states have call predecessors, (64), 62 states have call successors, (64) [2024-10-14 02:57:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 567 transitions. [2024-10-14 02:57:37,516 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 567 transitions. Word has length 105 [2024-10-14 02:57:37,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:57:37,516 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 567 transitions. [2024-10-14 02:57:37,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 02:57:37,516 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 567 transitions. [2024-10-14 02:57:37,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-14 02:57:37,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:57:37,519 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] [2024-10-14 02:57:37,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 02:57:37,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:57:37,720 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:57:37,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:57:37,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1427703417, now seen corresponding path program 1 times [2024-10-14 02:57:37,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:57:37,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495037435] [2024-10-14 02:57:37,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:57:37,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:57:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:37,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:57:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:37,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:57:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:37,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:57:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:37,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:57:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:37,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 02:57:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:37,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 02:57:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:37,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 02:57:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:37,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 02:57:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:37,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 02:57:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:37,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 02:57:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:37,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 02:57:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:37,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 02:57:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:38,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 02:57:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:38,002 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-14 02:57:38,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:57:38,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495037435] [2024-10-14 02:57:38,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495037435] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:57:38,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425213113] [2024-10-14 02:57:38,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:57:38,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:57:38,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:57:38,005 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:57:38,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 02:57:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:38,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 02:57:38,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:57:38,362 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-14 02:57:38,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:57:38,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425213113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:57:38,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:57:38,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-14 02:57:38,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212263084] [2024-10-14 02:57:38,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:57:38,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:57:38,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:57:38,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:57:38,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-14 02:57:38,368 INFO L87 Difference]: Start difference. First operand 364 states and 567 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 02:57:38,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:57:38,488 INFO L93 Difference]: Finished difference Result 721 states and 1127 transitions. [2024-10-14 02:57:38,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 02:57:38,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 106 [2024-10-14 02:57:38,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:57:38,492 INFO L225 Difference]: With dead ends: 721 [2024-10-14 02:57:38,493 INFO L226 Difference]: Without dead ends: 366 [2024-10-14 02:57:38,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 124 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-14 02:57:38,496 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 2 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:57:38,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1767 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:57:38,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-14 02:57:38,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2024-10-14 02:57:38,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 279 states have (on average 1.5734767025089607) internal successors, (439), 283 states have internal predecessors, (439), 65 states have call successors, (65), 20 states have call predecessors, (65), 21 states have return successors, (69), 62 states have call predecessors, (69), 62 states have call successors, (69) [2024-10-14 02:57:38,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 573 transitions. [2024-10-14 02:57:38,520 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 573 transitions. Word has length 106 [2024-10-14 02:57:38,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:57:38,520 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 573 transitions. [2024-10-14 02:57:38,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 02:57:38,520 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 573 transitions. [2024-10-14 02:57:38,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 02:57:38,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:57:38,522 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] [2024-10-14 02:57:38,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 02:57:38,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:57:38,723 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:57:38,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:57:38,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1142427840, now seen corresponding path program 1 times [2024-10-14 02:57:38,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:57:38,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219001507] [2024-10-14 02:57:38,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:57:38,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:57:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:38,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:57:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:38,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:57:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:38,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:57:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:38,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:57:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:38,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:57:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:38,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 02:57:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:38,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:57:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:38,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 02:57:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:38,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 02:57:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:38,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 02:57:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:38,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 02:57:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:38,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 02:57:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:38,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 02:57:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:38,931 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-14 02:57:38,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:57:38,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219001507] [2024-10-14 02:57:38,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219001507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:57:38,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:57:38,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:57:38,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458046374] [2024-10-14 02:57:38,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:57:38,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:57:38,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:57:38,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:57:38,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:57:38,934 INFO L87 Difference]: Start difference. First operand 366 states and 573 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 02:57:41,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:57:41,150 INFO L93 Difference]: Finished difference Result 873 states and 1384 transitions. [2024-10-14 02:57:41,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 02:57:41,150 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 107 [2024-10-14 02:57:41,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:57:41,154 INFO L225 Difference]: With dead ends: 873 [2024-10-14 02:57:41,154 INFO L226 Difference]: Without dead ends: 526 [2024-10-14 02:57:41,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 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-14 02:57:41,156 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 1019 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 2596 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 2942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 2596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 02:57:41,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 1015 Invalid, 2942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 2596 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 02:57:41,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-14 02:57:41,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 366. [2024-10-14 02:57:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 279 states have (on average 1.5734767025089607) internal successors, (439), 283 states have internal predecessors, (439), 65 states have call successors, (65), 20 states have call predecessors, (65), 21 states have return successors, (68), 62 states have call predecessors, (68), 62 states have call successors, (68) [2024-10-14 02:57:41,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 572 transitions. [2024-10-14 02:57:41,202 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 572 transitions. Word has length 107 [2024-10-14 02:57:41,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:57:41,202 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 572 transitions. [2024-10-14 02:57:41,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 02:57:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 572 transitions. [2024-10-14 02:57:41,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 02:57:41,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:57:41,206 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] [2024-10-14 02:57:41,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 02:57:41,206 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:57:41,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:57:41,207 INFO L85 PathProgramCache]: Analyzing trace with hash -565605437, now seen corresponding path program 2 times [2024-10-14 02:57:41,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:57:41,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905203478] [2024-10-14 02:57:41,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:57:41,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:57:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:41,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:57:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:41,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:57:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:41,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:57:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:41,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:57:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:41,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:57:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:41,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:57:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:41,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-14 02:57:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:41,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 02:57:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:41,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 02:57:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:41,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 02:57:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:41,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 02:57:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:41,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 02:57:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:41,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 02:57:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:41,412 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-14 02:57:41,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:57:41,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905203478] [2024-10-14 02:57:41,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905203478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:57:41,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:57:41,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:57:41,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650565398] [2024-10-14 02:57:41,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:57:41,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:57:41,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:57:41,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:57:41,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:57:41,414 INFO L87 Difference]: Start difference. First operand 366 states and 572 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 02:57:43,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:57:43,550 INFO L93 Difference]: Finished difference Result 875 states and 1387 transitions. [2024-10-14 02:57:43,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 02:57:43,551 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 108 [2024-10-14 02:57:43,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:57:43,555 INFO L225 Difference]: With dead ends: 875 [2024-10-14 02:57:43,555 INFO L226 Difference]: Without dead ends: 528 [2024-10-14 02:57:43,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 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-14 02:57:43,558 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1014 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 2618 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 2962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 2618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 02:57:43,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 1016 Invalid, 2962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 2618 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 02:57:43,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-10-14 02:57:43,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 368. [2024-10-14 02:57:43,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 280 states have (on average 1.5714285714285714) internal successors, (440), 285 states have internal predecessors, (440), 65 states have call successors, (65), 20 states have call predecessors, (65), 22 states have return successors, (70), 62 states have call predecessors, (70), 62 states have call successors, (70) [2024-10-14 02:57:43,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 575 transitions. [2024-10-14 02:57:43,610 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 575 transitions. Word has length 108 [2024-10-14 02:57:43,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:57:43,610 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 575 transitions. [2024-10-14 02:57:43,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 02:57:43,610 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 575 transitions. [2024-10-14 02:57:43,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 02:57:43,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:57:43,612 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] [2024-10-14 02:57:43,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 02:57:43,613 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:57:43,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:57:43,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1907365467, now seen corresponding path program 1 times [2024-10-14 02:57:43,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:57:43,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297602216] [2024-10-14 02:57:43,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:57:43,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:57:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:43,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:57:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:43,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:57:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:43,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:57:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:43,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:57:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:43,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:57:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:43,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:57:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:43,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 02:57:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:43,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 02:57:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:43,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 02:57:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:43,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 02:57:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:43,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 02:57:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:43,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 02:57:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:43,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 02:57:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:43,843 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-14 02:57:43,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:57:43,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297602216] [2024-10-14 02:57:43,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297602216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:57:43,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:57:43,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 02:57:43,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866938956] [2024-10-14 02:57:43,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:57:43,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 02:57:43,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:57:43,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 02:57:43,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:57:43,845 INFO L87 Difference]: Start difference. First operand 368 states and 575 transitions. Second operand has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-14 02:57:46,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:57:46,416 INFO L93 Difference]: Finished difference Result 873 states and 1382 transitions. [2024-10-14 02:57:46,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:57:46,416 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 109 [2024-10-14 02:57:46,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:57:46,421 INFO L225 Difference]: With dead ends: 873 [2024-10-14 02:57:46,421 INFO L226 Difference]: Without dead ends: 528 [2024-10-14 02:57:46,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-14 02:57:46,423 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 1031 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 4243 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 4601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 4243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:57:46,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 1408 Invalid, 4601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 4243 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-14 02:57:46,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-10-14 02:57:46,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 368. [2024-10-14 02:57:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 280 states have (on average 1.5714285714285714) internal successors, (440), 285 states have internal predecessors, (440), 65 states have call successors, (65), 20 states have call predecessors, (65), 22 states have return successors, (69), 62 states have call predecessors, (69), 62 states have call successors, (69) [2024-10-14 02:57:46,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 574 transitions. [2024-10-14 02:57:46,454 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 574 transitions. Word has length 109 [2024-10-14 02:57:46,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:57:46,455 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 574 transitions. [2024-10-14 02:57:46,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-14 02:57:46,456 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 574 transitions. [2024-10-14 02:57:46,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 02:57:46,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:57:46,458 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] [2024-10-14 02:57:46,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 02:57:46,458 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:57:46,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:57:46,459 INFO L85 PathProgramCache]: Analyzing trace with hash 882857144, now seen corresponding path program 2 times [2024-10-14 02:57:46,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:57:46,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300429929] [2024-10-14 02:57:46,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:57:46,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:57:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:46,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:57:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:46,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:57:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:46,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:57:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:46,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:57:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:46,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:57:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:46,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:57:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:46,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 02:57:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:46,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 02:57:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:46,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 02:57:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:46,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 02:57:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:46,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 02:57:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:46,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 02:57:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:46,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 02:57:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-14 02:57:46,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:57:46,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300429929] [2024-10-14 02:57:46,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300429929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:57:46,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:57:46,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 02:57:46,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243637158] [2024-10-14 02:57:46,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:57:46,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 02:57:46,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:57:46,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 02:57:46,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:57:46,698 INFO L87 Difference]: Start difference. First operand 368 states and 574 transitions. Second operand has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-14 02:57:49,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:57:49,138 INFO L93 Difference]: Finished difference Result 875 states and 1388 transitions. [2024-10-14 02:57:49,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:57:49,139 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 110 [2024-10-14 02:57:49,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:57:49,142 INFO L225 Difference]: With dead ends: 875 [2024-10-14 02:57:49,142 INFO L226 Difference]: Without dead ends: 530 [2024-10-14 02:57:49,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-14 02:57:49,144 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 1027 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 4262 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 4617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 4262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:57:49,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 1408 Invalid, 4617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 4262 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 02:57:49,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-10-14 02:57:49,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 370. [2024-10-14 02:57:49,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 281 states have (on average 1.5693950177935942) internal successors, (441), 287 states have internal predecessors, (441), 65 states have call successors, (65), 20 states have call predecessors, (65), 23 states have return successors, (74), 62 states have call predecessors, (74), 62 states have call successors, (74) [2024-10-14 02:57:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 580 transitions. [2024-10-14 02:57:49,172 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 580 transitions. Word has length 110 [2024-10-14 02:57:49,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:57:49,172 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 580 transitions. [2024-10-14 02:57:49,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-14 02:57:49,173 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 580 transitions. [2024-10-14 02:57:49,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 02:57:49,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:57:49,175 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] [2024-10-14 02:57:49,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 02:57:49,175 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:57:49,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:57:49,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1905315124, now seen corresponding path program 1 times [2024-10-14 02:57:49,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:57:49,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328301901] [2024-10-14 02:57:49,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:57:49,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:57:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:49,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:57:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:49,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:57:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:49,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:57:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:49,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:57:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:49,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:57:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:49,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:57:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:49,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 02:57:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:49,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 02:57:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:49,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 02:57:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:49,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 02:57:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:49,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 02:57:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:49,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 02:57:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:49,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 02:57:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-14 02:57:49,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:57:49,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328301901] [2024-10-14 02:57:49,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328301901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:57:49,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:57:49,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:57:49,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974090047] [2024-10-14 02:57:49,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:57:49,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:57:49,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:57:49,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:57:49,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:57:49,330 INFO L87 Difference]: Start difference. First operand 370 states and 580 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 02:57:51,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:57:51,154 INFO L93 Difference]: Finished difference Result 877 states and 1391 transitions. [2024-10-14 02:57:51,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:57:51,155 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2024-10-14 02:57:51,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:57:51,158 INFO L225 Difference]: With dead ends: 877 [2024-10-14 02:57:51,159 INFO L226 Difference]: Without dead ends: 530 [2024-10-14 02:57:51,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-14 02:57:51,161 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1014 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 2616 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 2962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 2616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:57:51,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 1008 Invalid, 2962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 2616 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 02:57:51,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-10-14 02:57:51,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 370. [2024-10-14 02:57:51,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 281 states have (on average 1.5693950177935942) internal successors, (441), 287 states have internal predecessors, (441), 65 states have call successors, (65), 20 states have call predecessors, (65), 23 states have return successors, (74), 62 states have call predecessors, (74), 62 states have call successors, (74) [2024-10-14 02:57:51,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 580 transitions. [2024-10-14 02:57:51,189 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 580 transitions. Word has length 111 [2024-10-14 02:57:51,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:57:51,189 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 580 transitions. [2024-10-14 02:57:51,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 02:57:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 580 transitions. [2024-10-14 02:57:51,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 02:57:51,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:57:51,192 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] [2024-10-14 02:57:51,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 02:57:51,192 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:57:51,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:57:51,192 INFO L85 PathProgramCache]: Analyzing trace with hash -937964470, now seen corresponding path program 1 times [2024-10-14 02:57:51,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:57:51,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964108354] [2024-10-14 02:57:51,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:57:51,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:57:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:51,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:57:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:51,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:57:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:51,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:57:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:51,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:57:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:51,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:57:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:51,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:57:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:51,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 02:57:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:51,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 02:57:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:51,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 02:57:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:51,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 02:57:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:51,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 02:57:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:51,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 02:57:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:51,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 02:57:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-14 02:57:51,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:57:51,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964108354] [2024-10-14 02:57:51,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964108354] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:57:51,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636221175] [2024-10-14 02:57:51,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:57:51,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:57:51,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:57:51,411 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:57:51,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 02:57:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:51,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 02:57:51,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:57:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:57:51,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:57:51,850 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:57:51,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636221175] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:57:51,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:57:51,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-10-14 02:57:51,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086150016] [2024-10-14 02:57:51,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:57:51,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 02:57:51,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:57:51,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 02:57:51,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-14 02:57:51,852 INFO L87 Difference]: Start difference. First operand 370 states and 580 transitions. Second operand has 15 states, 14 states have (on average 8.714285714285714) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (32), 6 states have call predecessors, (32), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-14 02:57:54,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:57:54,453 INFO L93 Difference]: Finished difference Result 1224 states and 2033 transitions. [2024-10-14 02:57:54,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 02:57:54,453 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 8.714285714285714) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (32), 6 states have call predecessors, (32), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 111 [2024-10-14 02:57:54,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:57:54,459 INFO L225 Difference]: With dead ends: 1224 [2024-10-14 02:57:54,459 INFO L226 Difference]: Without dead ends: 880 [2024-10-14 02:57:54,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2024-10-14 02:57:54,462 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 2196 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 4214 mSolverCounterSat, 663 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2213 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 4877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 663 IncrementalHoareTripleChecker+Valid, 4214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:57:54,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2213 Valid, 1518 Invalid, 4877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [663 Valid, 4214 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 02:57:54,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-10-14 02:57:54,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 705. [2024-10-14 02:57:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 552 states have (on average 1.6195652173913044) internal successors, (894), 558 states have internal predecessors, (894), 129 states have call successors, (129), 20 states have call predecessors, (129), 23 states have return successors, (148), 126 states have call predecessors, (148), 126 states have call successors, (148) [2024-10-14 02:57:54,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1171 transitions. [2024-10-14 02:57:54,507 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1171 transitions. Word has length 111 [2024-10-14 02:57:54,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:57:54,507 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 1171 transitions. [2024-10-14 02:57:54,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 8.714285714285714) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (32), 6 states have call predecessors, (32), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-14 02:57:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1171 transitions. [2024-10-14 02:57:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 02:57:54,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:57:54,511 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] [2024-10-14 02:57:54,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 02:57:54,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:57:54,712 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:57:54,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:57:54,713 INFO L85 PathProgramCache]: Analyzing trace with hash -981538707, now seen corresponding path program 1 times [2024-10-14 02:57:54,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:57:54,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057161625] [2024-10-14 02:57:54,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:57:54,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:57:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:54,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:57:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:54,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:57:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:54,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:57:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:54,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:57:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:54,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:57:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:54,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:57:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:54,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 02:57:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:54,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 02:57:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:54,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 02:57:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:54,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 02:57:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:54,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 02:57:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:54,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 02:57:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:54,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 02:57:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:54,836 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-14 02:57:54,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:57:54,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057161625] [2024-10-14 02:57:54,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057161625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:57:54,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:57:54,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:57:54,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328130354] [2024-10-14 02:57:54,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:57:54,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:57:54,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:57:54,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:57:54,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:57:54,838 INFO L87 Difference]: Start difference. First operand 705 states and 1171 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:57:56,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:57:56,306 INFO L93 Difference]: Finished difference Result 1819 states and 3092 transitions. [2024-10-14 02:57:56,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:57:56,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2024-10-14 02:57:56,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:57:56,314 INFO L225 Difference]: With dead ends: 1819 [2024-10-14 02:57:56,314 INFO L226 Difference]: Without dead ends: 1182 [2024-10-14 02:57:56,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-14 02:57:56,317 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1130 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:57:56,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 790 Invalid, 1912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 02:57:56,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2024-10-14 02:57:56,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1017. [2024-10-14 02:57:56,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 800 states have (on average 1.6325) internal successors, (1306), 806 states have internal predecessors, (1306), 193 states have call successors, (193), 20 states have call predecessors, (193), 23 states have return successors, (222), 190 states have call predecessors, (222), 190 states have call successors, (222) [2024-10-14 02:57:56,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1721 transitions. [2024-10-14 02:57:56,395 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1721 transitions. Word has length 115 [2024-10-14 02:57:56,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:57:56,396 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1721 transitions. [2024-10-14 02:57:56,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:57:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1721 transitions. [2024-10-14 02:57:56,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 02:57:56,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:57:56,402 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] [2024-10-14 02:57:56,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 02:57:56,402 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:57:56,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:57:56,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1472888400, now seen corresponding path program 1 times [2024-10-14 02:57:56,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:57:56,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471651099] [2024-10-14 02:57:56,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:57:56,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:57:56,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:56,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:57:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:56,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:57:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:56,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:57:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:56,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:57:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:56,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:57:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:56,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:57:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:56,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 02:57:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:56,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 02:57:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:56,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 02:57:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:56,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 02:57:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:56,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 02:57:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:56,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 02:57:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:56,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 02:57:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:56,515 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-14 02:57:56,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:57:56,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471651099] [2024-10-14 02:57:56,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471651099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:57:56,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:57:56,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:57:56,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194291121] [2024-10-14 02:57:56,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:57:56,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:57:56,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:57:56,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:57:56,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:57:56,521 INFO L87 Difference]: Start difference. First operand 1017 states and 1721 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:57:57,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:57:57,906 INFO L93 Difference]: Finished difference Result 2588 states and 4440 transitions. [2024-10-14 02:57:57,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:57:57,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2024-10-14 02:57:57,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:57:57,915 INFO L225 Difference]: With dead ends: 2588 [2024-10-14 02:57:57,915 INFO L226 Difference]: Without dead ends: 1689 [2024-10-14 02:57:57,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-14 02:57:57,919 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1127 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:57:57,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 744 Invalid, 1881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 02:57:57,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2024-10-14 02:57:57,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1524. [2024-10-14 02:57:57,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 1212 states have (on average 1.6386138613861385) internal successors, (1986), 1218 states have internal predecessors, (1986), 288 states have call successors, (288), 20 states have call predecessors, (288), 23 states have return successors, (317), 285 states have call predecessors, (317), 285 states have call successors, (317) [2024-10-14 02:57:58,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 2591 transitions. [2024-10-14 02:57:58,005 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 2591 transitions. Word has length 116 [2024-10-14 02:57:58,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:57:58,006 INFO L471 AbstractCegarLoop]: Abstraction has 1524 states and 2591 transitions. [2024-10-14 02:57:58,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:57:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 2591 transitions. [2024-10-14 02:57:58,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 02:57:58,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:57:58,014 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] [2024-10-14 02:57:58,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 02:57:58,014 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:57:58,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:57:58,015 INFO L85 PathProgramCache]: Analyzing trace with hash -65702629, now seen corresponding path program 1 times [2024-10-14 02:57:58,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:57:58,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966671066] [2024-10-14 02:57:58,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:57:58,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:57:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:58,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:57:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:58,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:57:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:58,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:57:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:58,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:57:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:58,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:57:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:58,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:57:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:58,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 02:57:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:58,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 02:57:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:58,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 02:57:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:58,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 02:57:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:58,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 02:57:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:58,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 02:57:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:58,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 02:57:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:58,128 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-14 02:57:58,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:57:58,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966671066] [2024-10-14 02:57:58,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966671066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:57:58,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:57:58,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:57:58,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501670333] [2024-10-14 02:57:58,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:57:58,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:57:58,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:57:58,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:57:58,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:57:58,130 INFO L87 Difference]: Start difference. First operand 1524 states and 2591 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:57:59,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:57:59,478 INFO L93 Difference]: Finished difference Result 3734 states and 6465 transitions. [2024-10-14 02:57:59,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:57:59,478 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2024-10-14 02:57:59,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:57:59,490 INFO L225 Difference]: With dead ends: 3734 [2024-10-14 02:57:59,490 INFO L226 Difference]: Without dead ends: 2456 [2024-10-14 02:57:59,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-14 02:57:59,494 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1125 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:57:59,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 737 Invalid, 1866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 02:57:59,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2456 states. [2024-10-14 02:57:59,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2456 to 2291. [2024-10-14 02:57:59,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2291 states, 1856 states have (on average 1.6438577586206897) internal successors, (3051), 1862 states have internal predecessors, (3051), 411 states have call successors, (411), 20 states have call predecessors, (411), 23 states have return successors, (456), 408 states have call predecessors, (456), 408 states have call successors, (456) [2024-10-14 02:57:59,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3918 transitions. [2024-10-14 02:57:59,595 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3918 transitions. Word has length 117 [2024-10-14 02:57:59,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:57:59,595 INFO L471 AbstractCegarLoop]: Abstraction has 2291 states and 3918 transitions. [2024-10-14 02:57:59,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:57:59,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3918 transitions. [2024-10-14 02:57:59,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 02:57:59,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:57:59,605 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] [2024-10-14 02:57:59,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 02:57:59,605 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:57:59,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:57:59,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1819111119, now seen corresponding path program 1 times [2024-10-14 02:57:59,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:57:59,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952396844] [2024-10-14 02:57:59,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:57:59,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:57:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:59,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:57:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:59,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:57:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:59,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:57:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:59,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:57:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:59,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:57:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:59,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:57:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:59,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 02:57:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:59,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 02:57:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:59,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 02:57:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:59,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 02:57:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:59,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 02:57:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:59,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 02:57:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:59,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 02:57:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:57:59,724 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-14 02:57:59,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:57:59,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952396844] [2024-10-14 02:57:59,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952396844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:57:59,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:57:59,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:57:59,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740376142] [2024-10-14 02:57:59,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:57:59,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:57:59,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:57:59,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:57:59,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:57:59,726 INFO L87 Difference]: Start difference. First operand 2291 states and 3918 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:58:01,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:58:01,201 INFO L93 Difference]: Finished difference Result 5516 states and 9623 transitions. [2024-10-14 02:58:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:58:01,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2024-10-14 02:58:01,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:58:01,221 INFO L225 Difference]: With dead ends: 5516 [2024-10-14 02:58:01,222 INFO L226 Difference]: Without dead ends: 3680 [2024-10-14 02:58:01,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-14 02:58:01,229 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 1112 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:58:01,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 736 Invalid, 1880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 02:58:01,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2024-10-14 02:58:01,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3515. [2024-10-14 02:58:01,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3515 states, 2901 states have (on average 1.6473629782833505) internal successors, (4779), 2907 states have internal predecessors, (4779), 590 states have call successors, (590), 20 states have call predecessors, (590), 23 states have return successors, (661), 587 states have call predecessors, (661), 587 states have call successors, (661) [2024-10-14 02:58:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 3515 states and 6030 transitions. [2024-10-14 02:58:01,439 INFO L78 Accepts]: Start accepts. Automaton has 3515 states and 6030 transitions. Word has length 118 [2024-10-14 02:58:01,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:58:01,439 INFO L471 AbstractCegarLoop]: Abstraction has 3515 states and 6030 transitions. [2024-10-14 02:58:01,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:58:01,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 6030 transitions. [2024-10-14 02:58:01,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-14 02:58:01,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:58:01,452 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] [2024-10-14 02:58:01,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 02:58:01,452 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:58:01,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:58:01,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1600890359, now seen corresponding path program 1 times [2024-10-14 02:58:01,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:58:01,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515584705] [2024-10-14 02:58:01,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:58:01,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:58:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:01,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:58:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:01,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:58:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:01,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:58:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:01,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:58:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:01,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:58:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:01,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:58:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:01,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 02:58:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:01,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 02:58:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:01,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 02:58:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:01,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 02:58:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:01,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 02:58:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:01,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 02:58:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:01,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 02:58:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:01,555 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-14 02:58:01,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:58:01,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515584705] [2024-10-14 02:58:01,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515584705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:58:01,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:58:01,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:58:01,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353548043] [2024-10-14 02:58:01,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:58:01,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:58:01,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:58:01,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:58:01,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:58:01,557 INFO L87 Difference]: Start difference. First operand 3515 states and 6030 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:58:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:58:02,970 INFO L93 Difference]: Finished difference Result 8495 states and 14863 transitions. [2024-10-14 02:58:02,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:58:02,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 119 [2024-10-14 02:58:02,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:58:03,005 INFO L225 Difference]: With dead ends: 8495 [2024-10-14 02:58:03,006 INFO L226 Difference]: Without dead ends: 5738 [2024-10-14 02:58:03,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-14 02:58:03,018 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 1112 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:58:03,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 746 Invalid, 1894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 02:58:03,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5738 states. [2024-10-14 02:58:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5738 to 5573. [2024-10-14 02:58:03,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5573 states, 4583 states have (on average 1.6369190486580842) internal successors, (7502), 4589 states have internal predecessors, (7502), 966 states have call successors, (966), 20 states have call predecessors, (966), 23 states have return successors, (1081), 963 states have call predecessors, (1081), 963 states have call successors, (1081) [2024-10-14 02:58:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5573 states to 5573 states and 9549 transitions. [2024-10-14 02:58:03,304 INFO L78 Accepts]: Start accepts. Automaton has 5573 states and 9549 transitions. Word has length 119 [2024-10-14 02:58:03,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:58:03,305 INFO L471 AbstractCegarLoop]: Abstraction has 5573 states and 9549 transitions. [2024-10-14 02:58:03,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:58:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 5573 states and 9549 transitions. [2024-10-14 02:58:03,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-14 02:58:03,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:58:03,322 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] [2024-10-14 02:58:03,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 02:58:03,323 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:58:03,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:58:03,323 INFO L85 PathProgramCache]: Analyzing trace with hash -383367083, now seen corresponding path program 1 times [2024-10-14 02:58:03,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:58:03,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136466476] [2024-10-14 02:58:03,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:58:03,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:58:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:03,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:58:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:03,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:58:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:03,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:58:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:03,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:58:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:03,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:58:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:03,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:58:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:03,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 02:58:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:03,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 02:58:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:03,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 02:58:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:03,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 02:58:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:03,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 02:58:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:03,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 02:58:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:03,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 02:58:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:03,425 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-14 02:58:03,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:58:03,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136466476] [2024-10-14 02:58:03,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136466476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:58:03,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:58:03,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:58:03,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724523761] [2024-10-14 02:58:03,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:58:03,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:58:03,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:58:03,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:58:03,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:58:03,428 INFO L87 Difference]: Start difference. First operand 5573 states and 9549 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:58:04,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:58:04,917 INFO L93 Difference]: Finished difference Result 13856 states and 24220 transitions. [2024-10-14 02:58:04,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:58:04,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2024-10-14 02:58:04,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:58:04,968 INFO L225 Difference]: With dead ends: 13856 [2024-10-14 02:58:04,968 INFO L226 Difference]: Without dead ends: 9427 [2024-10-14 02:58:04,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-14 02:58:04,984 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1109 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:58:04,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 744 Invalid, 1901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 02:58:04,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9427 states. [2024-10-14 02:58:05,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9427 to 9262. [2024-10-14 02:58:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9262 states, 7666 states have (on average 1.6347508478998174) internal successors, (12532), 7672 states have internal predecessors, (12532), 1572 states have call successors, (1572), 20 states have call predecessors, (1572), 23 states have return successors, (1765), 1569 states have call predecessors, (1765), 1569 states have call successors, (1765) [2024-10-14 02:58:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9262 states to 9262 states and 15869 transitions. [2024-10-14 02:58:05,419 INFO L78 Accepts]: Start accepts. Automaton has 9262 states and 15869 transitions. Word has length 120 [2024-10-14 02:58:05,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:58:05,419 INFO L471 AbstractCegarLoop]: Abstraction has 9262 states and 15869 transitions. [2024-10-14 02:58:05,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:58:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 9262 states and 15869 transitions. [2024-10-14 02:58:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 02:58:05,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:58:05,444 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] [2024-10-14 02:58:05,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 02:58:05,445 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:58:05,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:58:05,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1435348229, now seen corresponding path program 1 times [2024-10-14 02:58:05,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:58:05,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849012321] [2024-10-14 02:58:05,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:58:05,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:58:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:05,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:58:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:05,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:58:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:05,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:58:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:05,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:58:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:05,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:58:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:05,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:58:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:05,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 02:58:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:05,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 02:58:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:05,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 02:58:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:05,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 02:58:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:05,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 02:58:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:05,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 02:58:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:05,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-14 02:58:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:05,554 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-14 02:58:05,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:58:05,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849012321] [2024-10-14 02:58:05,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849012321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:58:05,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:58:05,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:58:05,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004331105] [2024-10-14 02:58:05,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:58:05,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:58:05,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:58:05,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:58:05,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:58:05,556 INFO L87 Difference]: Start difference. First operand 9262 states and 15869 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, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:58:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:58:07,223 INFO L93 Difference]: Finished difference Result 24048 states and 41984 transitions. [2024-10-14 02:58:07,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:58:07,223 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, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2024-10-14 02:58:07,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:58:07,296 INFO L225 Difference]: With dead ends: 24048 [2024-10-14 02:58:07,296 INFO L226 Difference]: Without dead ends: 16387 [2024-10-14 02:58:07,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-14 02:58:07,332 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 1117 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 1503 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:58:07,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 782 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1503 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 02:58:07,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16387 states. [2024-10-14 02:58:07,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16387 to 16222. [2024-10-14 02:58:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16222 states, 13423 states have (on average 1.6259405498025776) internal successors, (21825), 13429 states have internal predecessors, (21825), 2775 states have call successors, (2775), 20 states have call predecessors, (2775), 23 states have return successors, (3112), 2772 states have call predecessors, (3112), 2772 states have call successors, (3112) [2024-10-14 02:58:07,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16222 states to 16222 states and 27712 transitions. [2024-10-14 02:58:07,987 INFO L78 Accepts]: Start accepts. Automaton has 16222 states and 27712 transitions. Word has length 121 [2024-10-14 02:58:07,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:58:07,988 INFO L471 AbstractCegarLoop]: Abstraction has 16222 states and 27712 transitions. [2024-10-14 02:58:07,988 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, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:58:07,988 INFO L276 IsEmpty]: Start isEmpty. Operand 16222 states and 27712 transitions. [2024-10-14 02:58:08,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-14 02:58:08,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:58:08,019 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] [2024-10-14 02:58:08,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 02:58:08,020 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:58:08,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:58:08,021 INFO L85 PathProgramCache]: Analyzing trace with hash -879642378, now seen corresponding path program 1 times [2024-10-14 02:58:08,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:58:08,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673730081] [2024-10-14 02:58:08,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:58:08,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:58:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:08,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:58:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:08,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:58:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:08,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:58:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:08,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:58:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:08,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:58:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:08,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:58:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:08,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 02:58:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:08,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 02:58:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:08,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 02:58:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:08,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 02:58:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:08,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 02:58:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:08,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 02:58:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:08,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 02:58:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:08,130 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-14 02:58:08,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:58:08,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673730081] [2024-10-14 02:58:08,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673730081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:58:08,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:58:08,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:58:08,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687352062] [2024-10-14 02:58:08,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:58:08,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:58:08,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:58:08,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:58:08,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:58:08,133 INFO L87 Difference]: Start difference. First operand 16222 states and 27712 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, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:58:09,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:58:09,985 INFO L93 Difference]: Finished difference Result 43023 states and 74996 transitions. [2024-10-14 02:58:09,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:58:09,986 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, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2024-10-14 02:58:09,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:58:10,113 INFO L225 Difference]: With dead ends: 43023 [2024-10-14 02:58:10,113 INFO L226 Difference]: Without dead ends: 29050 [2024-10-14 02:58:10,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-14 02:58:10,254 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 1104 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:58:10,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 737 Invalid, 1892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 02:58:10,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29050 states. [2024-10-14 02:58:11,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29050 to 28885. [2024-10-14 02:58:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28885 states, 24047 states have (on average 1.622281365658918) internal successors, (39011), 24053 states have internal predecessors, (39011), 4814 states have call successors, (4814), 20 states have call predecessors, (4814), 23 states have return successors, (5425), 4811 states have call predecessors, (5425), 4811 states have call successors, (5425) [2024-10-14 02:58:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28885 states to 28885 states and 49250 transitions. [2024-10-14 02:58:11,624 INFO L78 Accepts]: Start accepts. Automaton has 28885 states and 49250 transitions. Word has length 122 [2024-10-14 02:58:11,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:58:11,625 INFO L471 AbstractCegarLoop]: Abstraction has 28885 states and 49250 transitions. [2024-10-14 02:58:11,625 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, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:58:11,626 INFO L276 IsEmpty]: Start isEmpty. Operand 28885 states and 49250 transitions. [2024-10-14 02:58:11,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-14 02:58:11,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:58:11,656 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] [2024-10-14 02:58:11,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 02:58:11,656 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:58:11,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:58:11,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1087460985, now seen corresponding path program 1 times [2024-10-14 02:58:11,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:58:11,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286083065] [2024-10-14 02:58:11,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:58:11,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:58:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:11,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:58:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:11,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:58:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:12,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:58:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:12,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:58:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:12,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:58:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:12,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:58:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:12,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 02:58:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:12,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 02:58:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:12,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 02:58:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:12,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 02:58:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:12,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 02:58:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:12,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 02:58:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:12,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 02:58:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:12,039 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-14 02:58:12,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:58:12,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286083065] [2024-10-14 02:58:12,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286083065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:58:12,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:58:12,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:58:12,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066931872] [2024-10-14 02:58:12,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:58:12,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:58:12,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:58:12,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:58:12,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:58:12,042 INFO L87 Difference]: Start difference. First operand 28885 states and 49250 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:58:14,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:58:14,589 INFO L93 Difference]: Finished difference Result 78795 states and 136555 transitions. [2024-10-14 02:58:14,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:58:14,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2024-10-14 02:58:14,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:58:14,947 INFO L225 Difference]: With dead ends: 78795 [2024-10-14 02:58:14,948 INFO L226 Difference]: Without dead ends: 52938 [2024-10-14 02:58:15,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-14 02:58:15,020 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 1104 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:58:15,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 743 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 02:58:15,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52938 states. [2024-10-14 02:58:17,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52938 to 52773. [2024-10-14 02:58:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52773 states, 44220 states have (on average 1.6173903211216645) internal successors, (71521), 44226 states have internal predecessors, (71521), 8529 states have call successors, (8529), 20 states have call predecessors, (8529), 23 states have return successors, (9672), 8526 states have call predecessors, (9672), 8526 states have call successors, (9672) [2024-10-14 02:58:17,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52773 states to 52773 states and 89722 transitions. [2024-10-14 02:58:17,326 INFO L78 Accepts]: Start accepts. Automaton has 52773 states and 89722 transitions. Word has length 123 [2024-10-14 02:58:17,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:58:17,327 INFO L471 AbstractCegarLoop]: Abstraction has 52773 states and 89722 transitions. [2024-10-14 02:58:17,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:58:17,328 INFO L276 IsEmpty]: Start isEmpty. Operand 52773 states and 89722 transitions. [2024-10-14 02:58:17,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 02:58:17,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:58:17,676 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-14 02:58:17,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 02:58:17,677 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:58:17,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:58:17,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2143369590, now seen corresponding path program 1 times [2024-10-14 02:58:17,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:58:17,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329448961] [2024-10-14 02:58:17,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:58:17,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:58:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:17,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:58:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:17,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:58:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:17,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:58:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:17,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:58:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:17,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:58:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:17,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:58:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:17,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 02:58:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:17,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 02:58:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:17,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 02:58:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:17,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 02:58:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:17,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 02:58:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:17,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 02:58:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:17,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 02:58:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:17,807 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-14 02:58:17,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:58:17,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329448961] [2024-10-14 02:58:17,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329448961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:58:17,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:58:17,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:58:17,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318924615] [2024-10-14 02:58:17,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:58:17,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:58:17,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:58:17,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:58:17,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:58:17,809 INFO L87 Difference]: Start difference. First operand 52773 states and 89722 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, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:58:20,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:58:20,969 INFO L93 Difference]: Finished difference Result 98570 states and 171260 transitions. [2024-10-14 02:58:20,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:58:20,969 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, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2024-10-14 02:58:20,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:58:21,422 INFO L225 Difference]: With dead ends: 98570 [2024-10-14 02:58:21,422 INFO L226 Difference]: Without dead ends: 98410 [2024-10-14 02:58:21,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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-14 02:58:21,486 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 1098 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:58:21,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 753 Invalid, 1918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 02:58:21,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98410 states. [2024-10-14 02:58:24,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98410 to 98245. [2024-10-14 02:58:24,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98245 states, 82893 states have (on average 1.611113121735249) internal successors, (133550), 82899 states have internal predecessors, (133550), 15328 states have call successors, (15328), 20 states have call predecessors, (15328), 23 states have return successors, (17517), 15325 states have call predecessors, (17517), 15325 states have call successors, (17517) [2024-10-14 02:58:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98245 states to 98245 states and 166395 transitions. [2024-10-14 02:58:25,721 INFO L78 Accepts]: Start accepts. Automaton has 98245 states and 166395 transitions. Word has length 124 [2024-10-14 02:58:25,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:58:25,722 INFO L471 AbstractCegarLoop]: Abstraction has 98245 states and 166395 transitions. [2024-10-14 02:58:25,725 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, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:58:25,726 INFO L276 IsEmpty]: Start isEmpty. Operand 98245 states and 166395 transitions. [2024-10-14 02:58:25,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-14 02:58:25,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:58:25,793 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-14 02:58:25,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 02:58:25,793 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:58:25,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:58:25,794 INFO L85 PathProgramCache]: Analyzing trace with hash -505694106, now seen corresponding path program 1 times [2024-10-14 02:58:25,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:58:25,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928102603] [2024-10-14 02:58:25,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:58:25,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:58:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:26,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:58:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:26,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:58:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:26,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:58:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:26,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:58:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:26,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:58:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:26,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:58:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:26,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 02:58:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:26,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 02:58:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:26,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 02:58:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:26,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 02:58:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:26,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 02:58:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:26,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 02:58:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:26,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 02:58:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:26,102 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-14 02:58:26,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:58:26,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928102603] [2024-10-14 02:58:26,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928102603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:58:26,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:58:26,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 02:58:26,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689280469] [2024-10-14 02:58:26,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:58:26,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 02:58:26,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:58:26,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 02:58:26,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:58:26,105 INFO L87 Difference]: Start difference. First operand 98245 states and 166395 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 02:58:32,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:58:32,990 INFO L93 Difference]: Finished difference Result 99412 states and 171486 transitions. [2024-10-14 02:58:32,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-14 02:58:32,990 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 125 [2024-10-14 02:58:32,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:58:33,512 INFO L225 Difference]: With dead ends: 99412 [2024-10-14 02:58:33,512 INFO L226 Difference]: Without dead ends: 99257 [2024-10-14 02:58:33,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=366, Invalid=1116, Unknown=0, NotChecked=0, Total=1482 [2024-10-14 02:58:33,574 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 2494 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 6272 mSolverCounterSat, 793 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2494 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 7065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 793 IncrementalHoareTripleChecker+Valid, 6272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-14 02:58:33,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2494 Valid, 972 Invalid, 7065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [793 Valid, 6272 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-14 02:58:33,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99257 states. [2024-10-14 02:58:36,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99257 to 98672. [2024-10-14 02:58:36,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98672 states, 83219 states have (on average 1.6106297840637354) internal successors, (134035), 83228 states have internal predecessors, (134035), 15391 states have call successors, (15391), 53 states have call predecessors, (15391), 61 states have return successors, (17588), 15390 states have call predecessors, (17588), 15385 states have call successors, (17588) [2024-10-14 02:58:37,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98672 states to 98672 states and 167014 transitions. [2024-10-14 02:58:37,577 INFO L78 Accepts]: Start accepts. Automaton has 98672 states and 167014 transitions. Word has length 125 [2024-10-14 02:58:37,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:58:37,578 INFO L471 AbstractCegarLoop]: Abstraction has 98672 states and 167014 transitions. [2024-10-14 02:58:37,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-14 02:58:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand 98672 states and 167014 transitions. [2024-10-14 02:58:37,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 02:58:37,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:58:37,627 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] [2024-10-14 02:58:37,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 02:58:37,627 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:58:37,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:58:37,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1377884372, now seen corresponding path program 1 times [2024-10-14 02:58:37,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:58:37,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900945883] [2024-10-14 02:58:37,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:58:37,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:58:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:37,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:58:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:37,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:58:37,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:37,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:58:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:37,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:58:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:37,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:58:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:37,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:58:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:37,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 02:58:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:37,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 02:58:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:37,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 02:58:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:37,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 02:58:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:37,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 02:58:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:37,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 02:58:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:37,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 02:58:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:37,953 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-14 02:58:37,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:58:37,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900945883] [2024-10-14 02:58:37,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900945883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:58:37,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:58:37,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 02:58:37,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504398245] [2024-10-14 02:58:37,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:58:37,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 02:58:37,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:58:37,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 02:58:37,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:58:37,956 INFO L87 Difference]: Start difference. First operand 98672 states and 167014 transitions. Second operand has 14 states, 12 states have (on average 7.0) internal successors, (84), 9 states have internal predecessors, (84), 6 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13)