./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 fca748b1 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.dd.update-z3-fca748b-m [2024-11-19 21:54:42,833 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 21:54:42,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 21:54:42,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 21:54:42,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 21:54:42,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 21:54:42,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 21:54:42,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 21:54:42,917 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 21:54:42,917 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 21:54:42,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 21:54:42,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 21:54:42,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 21:54:42,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 21:54:42,920 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 21:54:42,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 21:54:42,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 21:54:42,920 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 21:54:42,921 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 21:54:42,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 21:54:42,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 21:54:42,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 21:54:42,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 21:54:42,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 21:54:42,925 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 21:54:42,925 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 21:54:42,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 21:54:42,925 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 21:54:42,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 21:54:42,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 21:54:42,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 21:54:42,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 21:54:42,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:54:42,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 21:54:42,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 21:54:42,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 21:54:42,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 21:54:42,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 21:54:42,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 21:54:42,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 21:54:42,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 21:54:42,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 21:54:42,928 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-11-19 21:54:43,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 21:54:43,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 21:54:43,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 21:54:43,148 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 21:54:43,149 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 21:54:43,149 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-11-19 21:54:44,307 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 21:54:44,619 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 21:54:44,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product24.cil.c [2024-11-19 21:54:44,643 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4e799360/997cd574d07145baa6c77f6d9cb9e354/FLAG608a82e0c [2024-11-19 21:54:44,653 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4e799360/997cd574d07145baa6c77f6d9cb9e354 [2024-11-19 21:54:44,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 21:54:44,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 21:54:44,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 21:54:44,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 21:54:44,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 21:54:44,661 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:54:44" (1/1) ... [2024-11-19 21:54:44,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2745fa32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:44, skipping insertion in model container [2024-11-19 21:54:44,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:54:44" (1/1) ... [2024-11-19 21:54:44,711 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 21:54:45,062 WARN L250 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-11-19 21:54:45,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:54:45,121 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 21:54:45,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2024-11-19 21:54:45,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [97] [2024-11-19 21:54:45,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [410] [2024-11-19 21:54:45,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [517] [2024-11-19 21:54:45,131 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1588] [2024-11-19 21:54:45,131 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1807] [2024-11-19 21:54:45,131 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2211] [2024-11-19 21:54:45,131 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2536] [2024-11-19 21:54:45,131 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2545] [2024-11-19 21:54:45,132 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2911] [2024-11-19 21:54:45,132 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [2928] [2024-11-19 21:54:45,202 WARN L250 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-11-19 21:54:45,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:54:45,247 INFO L204 MainTranslator]: Completed translation [2024-11-19 21:54:45,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:45 WrapperNode [2024-11-19 21:54:45,248 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 21:54:45,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 21:54:45,249 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 21:54:45,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 21:54:45,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:45" (1/1) ... [2024-11-19 21:54:45,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:45" (1/1) ... [2024-11-19 21:54:45,318 INFO L138 Inliner]: procedures = 131, calls = 200, calls flagged for inlining = 62, calls inlined = 57, statements flattened = 1029 [2024-11-19 21:54:45,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 21:54:45,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 21:54:45,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 21:54:45,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 21:54:45,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:45" (1/1) ... [2024-11-19 21:54:45,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:45" (1/1) ... [2024-11-19 21:54:45,335 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:45" (1/1) ... [2024-11-19 21:54:45,356 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-11-19 21:54:45,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:45" (1/1) ... [2024-11-19 21:54:45,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:45" (1/1) ... [2024-11-19 21:54:45,375 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:45" (1/1) ... [2024-11-19 21:54:45,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:45" (1/1) ... [2024-11-19 21:54:45,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:45" (1/1) ... [2024-11-19 21:54:45,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:45" (1/1) ... [2024-11-19 21:54:45,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 21:54:45,408 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 21:54:45,408 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 21:54:45,408 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 21:54:45,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:45" (1/1) ... [2024-11-19 21:54:45,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:54:45,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:54:45,441 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-11-19 21:54:45,443 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-11-19 21:54:45,482 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-19 21:54:45,482 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-19 21:54:45,482 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-19 21:54:45,482 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-19 21:54:45,482 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-19 21:54:45,482 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-19 21:54:45,482 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-19 21:54:45,483 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-19 21:54:45,483 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-19 21:54:45,483 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-19 21:54:45,484 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-19 21:54:45,484 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-19 21:54:45,484 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-19 21:54:45,484 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-19 21:54:45,485 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2024-11-19 21:54:45,485 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2024-11-19 21:54:45,485 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-19 21:54:45,485 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-19 21:54:45,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 21:54:45,485 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-19 21:54:45,485 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-19 21:54:45,485 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-11-19 21:54:45,485 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-11-19 21:54:45,485 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-19 21:54:45,485 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-19 21:54:45,485 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-11-19 21:54:45,485 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-11-19 21:54:45,485 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-19 21:54:45,486 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-19 21:54:45,486 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-19 21:54:45,486 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-19 21:54:45,486 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-11-19 21:54:45,486 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-11-19 21:54:45,486 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-19 21:54:45,486 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-19 21:54:45,488 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-19 21:54:45,488 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-19 21:54:45,488 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-19 21:54:45,488 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-19 21:54:45,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 21:54:45,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 21:54:45,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 21:54:45,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 21:54:45,489 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-19 21:54:45,489 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-19 21:54:45,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 21:54:45,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 21:54:45,642 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 21:54:45,645 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 21:54:46,310 INFO L? ?]: Removed 457 outVars from TransFormulas that were not future-live. [2024-11-19 21:54:46,311 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 21:54:46,330 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 21:54:46,330 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 21:54:46,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:54:46 BoogieIcfgContainer [2024-11-19 21:54:46,330 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 21:54:46,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 21:54:46,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 21:54:46,334 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 21:54:46,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:54:44" (1/3) ... [2024-11-19 21:54:46,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73dc6831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:54:46, skipping insertion in model container [2024-11-19 21:54:46,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:45" (2/3) ... [2024-11-19 21:54:46,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73dc6831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:54:46, skipping insertion in model container [2024-11-19 21:54:46,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:54:46" (3/3) ... [2024-11-19 21:54:46,336 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec3_product24.cil.c [2024-11-19 21:54:46,347 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 21:54:46,347 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 21:54:46,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 21:54:46,407 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;@16f55b9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 21:54:46,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 21:54:46,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 342 states, 266 states have (on average 1.518796992481203) internal successors, (404), 270 states have internal predecessors, (404), 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-11-19 21:54:46,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 21:54:46,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:46,432 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:46,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:46,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:46,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1780526954, now seen corresponding path program 1 times [2024-11-19 21:54:46,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:46,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830317841] [2024-11-19 21:54:46,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:46,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:46,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:46,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:46,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:46,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:54:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:54:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:54:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 21:54:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-19 21:54:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-19 21:54:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:54:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:54:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:54:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:54:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 21:54:47,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:47,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830317841] [2024-11-19 21:54:47,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830317841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:54:47,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100676685] [2024-11-19 21:54:47,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:47,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:54:47,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:54:47,063 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-11-19 21:54:47,065 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-11-19 21:54:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 21:54:47,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:54:47,366 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:54:47,367 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:54:47,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100676685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:47,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:54:47,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-19 21:54:47,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4887297] [2024-11-19 21:54:47,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:47,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 21:54:47,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:47,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 21:54:47,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:54:47,399 INFO L87 Difference]: Start difference. First operand has 342 states, 266 states have (on average 1.518796992481203) internal successors, (404), 270 states have internal predecessors, (404), 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 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:54:47,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:47,462 INFO L93 Difference]: Finished difference Result 524 states and 770 transitions. [2024-11-19 21:54:47,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 21:54:47,464 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 103 [2024-11-19 21:54:47,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:47,477 INFO L225 Difference]: With dead ends: 524 [2024-11-19 21:54:47,477 INFO L226 Difference]: Without dead ends: 334 [2024-11-19 21:54:47,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 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-11-19 21:54:47,487 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:54:47,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:54:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-19 21:54:47,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2024-11-19 21:54:47,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 260 states have (on average 1.5115384615384615) internal successors, (393), 262 states have internal predecessors, (393), 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-11-19 21:54:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 498 transitions. [2024-11-19 21:54:47,543 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 498 transitions. Word has length 103 [2024-11-19 21:54:47,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:47,545 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 498 transitions. [2024-11-19 21:54:47,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:54:47,545 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 498 transitions. [2024-11-19 21:54:47,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 21:54:47,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:47,551 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:47,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 21:54:47,752 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-11-19 21:54:47,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:47,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:47,753 INFO L85 PathProgramCache]: Analyzing trace with hash 344225564, now seen corresponding path program 1 times [2024-11-19 21:54:47,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:47,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548454293] [2024-11-19 21:54:47,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:47,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:54:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:54:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:54:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-19 21:54:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:54:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-19 21:54:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:54:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:54:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:54:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-19 21:54:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,969 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 21:54:47,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:47,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548454293] [2024-11-19 21:54:47,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548454293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:54:47,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090737946] [2024-11-19 21:54:47,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:47,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:54:47,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:54:47,975 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-11-19 21:54:47,976 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-11-19 21:54:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:48,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 21:54:48,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:54:48,229 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:54:48,229 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:54:48,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090737946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:48,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:54:48,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-19 21:54:48,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089262880] [2024-11-19 21:54:48,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:48,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 21:54:48,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:48,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 21:54:48,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:54:48,231 INFO L87 Difference]: Start difference. First operand 334 states and 498 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-11-19 21:54:48,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:48,284 INFO L93 Difference]: Finished difference Result 513 states and 747 transitions. [2024-11-19 21:54:48,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 21:54:48,284 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-11-19 21:54:48,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:48,287 INFO L225 Difference]: With dead ends: 513 [2024-11-19 21:54:48,287 INFO L226 Difference]: Without dead ends: 337 [2024-11-19 21:54:48,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:54:48,289 INFO L432 NwaCegarLoop]: 496 mSDtfsCounter, 1 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:54:48,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 990 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:54:48,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-19 21:54:48,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 336. [2024-11-19 21:54:48,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 262 states have (on average 1.5076335877862594) internal successors, (395), 264 states have internal predecessors, (395), 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-11-19 21:54:48,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 500 transitions. [2024-11-19 21:54:48,304 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 500 transitions. Word has length 104 [2024-11-19 21:54:48,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:48,305 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 500 transitions. [2024-11-19 21:54:48,305 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-11-19 21:54:48,305 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 500 transitions. [2024-11-19 21:54:48,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 21:54:48,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:48,306 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:48,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 21:54:48,507 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-11-19 21:54:48,507 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:48,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:48,508 INFO L85 PathProgramCache]: Analyzing trace with hash 726734753, now seen corresponding path program 1 times [2024-11-19 21:54:48,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:48,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830460389] [2024-11-19 21:54:48,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:48,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:48,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:48,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:48,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:48,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:54:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:48,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:54:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:48,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:54:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:48,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-19 21:54:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:48,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-19 21:54:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:48,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:54:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:48,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-19 21:54:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:48,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 21:54:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:48,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:54:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:48,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:54:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 21:54:48,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:48,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830460389] [2024-11-19 21:54:48,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830460389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:54:48,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372993544] [2024-11-19 21:54:48,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:48,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:54:48,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:54:48,702 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-11-19 21:54:48,703 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-11-19 21:54:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:48,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 21:54:48,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:54:48,959 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:54:48,959 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:54:48,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372993544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:48,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:54:48,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-19 21:54:48,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028303803] [2024-11-19 21:54:48,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:48,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 21:54:48,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:48,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 21:54:48,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:54:48,961 INFO L87 Difference]: Start difference. First operand 336 states and 500 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-11-19 21:54:48,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:48,980 INFO L93 Difference]: Finished difference Result 707 states and 1067 transitions. [2024-11-19 21:54:48,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 21:54:48,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 113 [2024-11-19 21:54:48,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:48,983 INFO L225 Difference]: With dead ends: 707 [2024-11-19 21:54:48,983 INFO L226 Difference]: Without dead ends: 398 [2024-11-19 21:54:48,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:54:48,984 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 115 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:54:48,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 959 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:54:48,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-19 21:54:49,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 390. [2024-11-19 21:54:49,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 305 states have (on average 1.5245901639344261) internal successors, (465), 307 states have internal predecessors, (465), 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-11-19 21:54:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 592 transitions. [2024-11-19 21:54:49,012 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 592 transitions. Word has length 113 [2024-11-19 21:54:49,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:49,012 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 592 transitions. [2024-11-19 21:54:49,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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-11-19 21:54:49,013 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 592 transitions. [2024-11-19 21:54:49,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 21:54:49,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:49,014 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:49,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 21:54:49,215 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-11-19 21:54:49,215 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:49,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:49,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1706986505, now seen corresponding path program 1 times [2024-11-19 21:54:49,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:49,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100250148] [2024-11-19 21:54:49,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:49,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:49,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:49,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:49,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:49,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:54:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:49,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:54:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:49,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:54:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:49,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-19 21:54:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:49,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:54:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:49,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-19 21:54:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:49,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-19 21:54:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:49,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 21:54:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:49,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-19 21:54:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:49,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-19 21:54:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:49,405 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 21:54:49,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:49,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100250148] [2024-11-19 21:54:49,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100250148] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:54:49,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887368608] [2024-11-19 21:54:49,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:49,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:54:49,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:54:49,408 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-11-19 21:54:49,411 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-11-19 21:54:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:49,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 21:54:49,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:54:49,710 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 21:54:49,711 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:54:49,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887368608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:49,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:54:49,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-19 21:54:49,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177937118] [2024-11-19 21:54:49,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:49,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:54:49,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:49,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:54:49,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:54:49,714 INFO L87 Difference]: Start difference. First operand 390 states and 592 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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-11-19 21:54:49,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:49,764 INFO L93 Difference]: Finished difference Result 771 states and 1174 transitions. [2024-11-19 21:54:49,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:54:49,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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 114 [2024-11-19 21:54:49,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:49,769 INFO L225 Difference]: With dead ends: 771 [2024-11-19 21:54:49,769 INFO L226 Difference]: Without dead ends: 392 [2024-11-19 21:54:49,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:54:49,772 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 2 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1949 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:54:49,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1949 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:54:49,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-19 21:54:49,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-11-19 21:54:49,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 306 states have (on average 1.522875816993464) internal successors, (466), 309 states have internal predecessors, (466), 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-11-19 21:54:49,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 595 transitions. [2024-11-19 21:54:49,786 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 595 transitions. Word has length 114 [2024-11-19 21:54:49,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:49,786 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 595 transitions. [2024-11-19 21:54:49,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 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-11-19 21:54:49,787 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 595 transitions. [2024-11-19 21:54:49,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 21:54:49,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:49,788 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:49,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 21:54:49,988 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-11-19 21:54:49,989 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:49,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:49,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1134399862, now seen corresponding path program 1 times [2024-11-19 21:54:49,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:49,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900979463] [2024-11-19 21:54:49,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:49,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:54:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:54:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:54:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-19 21:54:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 21:54:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:54:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-19 21:54:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-19 21:54:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-19 21:54:50,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 21:54:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,179 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:54:50,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:50,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900979463] [2024-11-19 21:54:50,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900979463] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:54:50,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164717644] [2024-11-19 21:54:50,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:50,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:54:50,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:54:50,182 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-11-19 21:54:50,182 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-11-19 21:54:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 21:54:50,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:54:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 21:54:50,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:54:50,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164717644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:50,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:54:50,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-19 21:54:50,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375246018] [2024-11-19 21:54:50,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:50,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:54:50,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:50,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:54:50,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-19 21:54:50,447 INFO L87 Difference]: Start difference. First operand 392 states and 595 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-11-19 21:54:50,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:50,521 INFO L93 Difference]: Finished difference Result 773 states and 1179 transitions. [2024-11-19 21:54:50,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:54:50,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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 115 [2024-11-19 21:54:50,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:50,528 INFO L225 Difference]: With dead ends: 773 [2024-11-19 21:54:50,529 INFO L226 Difference]: Without dead ends: 394 [2024-11-19 21:54:50,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-19 21:54:50,531 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 2 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:54:50,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1935 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:54:50,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-19 21:54:50,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-19 21:54:50,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 307 states have (on average 1.521172638436482) internal successors, (467), 311 states have internal predecessors, (467), 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-11-19 21:54:50,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 601 transitions. [2024-11-19 21:54:50,552 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 601 transitions. Word has length 115 [2024-11-19 21:54:50,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:50,552 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 601 transitions. [2024-11-19 21:54:50,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-11-19 21:54:50,553 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 601 transitions. [2024-11-19 21:54:50,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 21:54:50,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:50,555 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:50,562 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-11-19 21:54:50,755 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-11-19 21:54:50,757 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:50,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:50,757 INFO L85 PathProgramCache]: Analyzing trace with hash 562962283, now seen corresponding path program 1 times [2024-11-19 21:54:50,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:50,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079063021] [2024-11-19 21:54:50,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:50,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:54:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:54:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-19 21:54:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-19 21:54:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-19 21:54:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:54:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-19 21:54:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:54:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-19 21:54:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-19 21:54:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,932 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 21:54:50,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:50,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079063021] [2024-11-19 21:54:50,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079063021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:50,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:54:50,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:54:50,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207636417] [2024-11-19 21:54:50,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:50,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:54:50,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:50,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:54:50,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:54:50,934 INFO L87 Difference]: Start difference. First operand 394 states and 601 transitions. Second operand has 9 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 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-11-19 21:54:52,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:52,653 INFO L93 Difference]: Finished difference Result 952 states and 1463 transitions. [2024-11-19 21:54:52,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 21:54:52,654 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 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 116 [2024-11-19 21:54:52,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:52,658 INFO L225 Difference]: With dead ends: 952 [2024-11-19 21:54:52,658 INFO L226 Difference]: Without dead ends: 581 [2024-11-19 21:54:52,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-19 21:54:52,661 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1081 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 2704 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 2704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 21:54:52,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 1171 Invalid, 3048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 2704 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 21:54:52,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-19 21:54:52,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 394. [2024-11-19 21:54:52,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 307 states have (on average 1.521172638436482) internal successors, (467), 311 states have internal predecessors, (467), 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-11-19 21:54:52,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 600 transitions. [2024-11-19 21:54:52,694 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 600 transitions. Word has length 116 [2024-11-19 21:54:52,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:52,694 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 600 transitions. [2024-11-19 21:54:52,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 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-11-19 21:54:52,694 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 600 transitions. [2024-11-19 21:54:52,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 21:54:52,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:52,697 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:52,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 21:54:52,697 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:52,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:52,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1066176242, now seen corresponding path program 2 times [2024-11-19 21:54:52,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:52,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748176895] [2024-11-19 21:54:52,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:52,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:54:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:54:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:54:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-19 21:54:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-19 21:54:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:54:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:54:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-19 21:54:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:54:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-19 21:54:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,883 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 21:54:52,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:52,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748176895] [2024-11-19 21:54:52,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748176895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:52,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:54:52,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:54:52,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134965714] [2024-11-19 21:54:52,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:52,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:54:52,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:52,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:54:52,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:54:52,885 INFO L87 Difference]: Start difference. First operand 394 states and 600 transitions. Second operand has 9 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 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-11-19 21:54:54,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:54,489 INFO L93 Difference]: Finished difference Result 954 states and 1466 transitions. [2024-11-19 21:54:54,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 21:54:54,489 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 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 117 [2024-11-19 21:54:54,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:54,492 INFO L225 Difference]: With dead ends: 954 [2024-11-19 21:54:54,492 INFO L226 Difference]: Without dead ends: 583 [2024-11-19 21:54:54,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-19 21:54:54,494 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1076 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 2737 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 3079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 2737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 21:54:54,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 1172 Invalid, 3079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 2737 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 21:54:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-19 21:54:54,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 396. [2024-11-19 21:54:54,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 308 states have (on average 1.5194805194805194) internal successors, (468), 313 states have internal predecessors, (468), 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-11-19 21:54:54,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 603 transitions. [2024-11-19 21:54:54,514 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 603 transitions. Word has length 117 [2024-11-19 21:54:54,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:54,516 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 603 transitions. [2024-11-19 21:54:54,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 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-11-19 21:54:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 603 transitions. [2024-11-19 21:54:54,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 21:54:54,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:54,517 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:54,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 21:54:54,517 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:54,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:54,518 INFO L85 PathProgramCache]: Analyzing trace with hash -407935386, now seen corresponding path program 1 times [2024-11-19 21:54:54,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:54,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173167517] [2024-11-19 21:54:54,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:54,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:54:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:54:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:54:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-19 21:54:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-19 21:54:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:54:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:54:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:54:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-19 21:54:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-19 21:54:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:54:54,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:54,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173167517] [2024-11-19 21:54:54,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173167517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:54,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:54:54,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 21:54:54,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922551504] [2024-11-19 21:54:54,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:54,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:54:54,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:54,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:54:54,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:54:54,730 INFO L87 Difference]: Start difference. First operand 396 states and 603 transitions. Second operand has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 8 states have internal predecessors, (81), 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-11-19 21:54:56,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:56,851 INFO L93 Difference]: Finished difference Result 952 states and 1461 transitions. [2024-11-19 21:54:56,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 21:54:56,854 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 8 states have internal predecessors, (81), 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 118 [2024-11-19 21:54:56,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:56,857 INFO L225 Difference]: With dead ends: 952 [2024-11-19 21:54:56,857 INFO L226 Difference]: Without dead ends: 583 [2024-11-19 21:54:56,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-19 21:54:56,860 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 1081 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 4486 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 4836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 4486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:54:56,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 1622 Invalid, 4836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 4486 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 21:54:56,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-19 21:54:56,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 396. [2024-11-19 21:54:56,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 308 states have (on average 1.5194805194805194) internal successors, (468), 313 states have internal predecessors, (468), 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-11-19 21:54:56,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 602 transitions. [2024-11-19 21:54:56,885 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 602 transitions. Word has length 118 [2024-11-19 21:54:56,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:56,885 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 602 transitions. [2024-11-19 21:54:56,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 8 states have internal predecessors, (81), 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-11-19 21:54:56,885 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 602 transitions. [2024-11-19 21:54:56,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 21:54:56,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:56,887 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:56,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 21:54:56,888 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:56,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:56,888 INFO L85 PathProgramCache]: Analyzing trace with hash -408110983, now seen corresponding path program 2 times [2024-11-19 21:54:56,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:56,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467884749] [2024-11-19 21:54:56,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:56,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:56,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:56,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:56,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:56,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:54:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:54:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:54:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:54:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-19 21:54:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-19 21:54:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-19 21:54:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:54:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:54:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-19 21:54:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,073 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:54:57,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:57,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467884749] [2024-11-19 21:54:57,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467884749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:57,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:54:57,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 21:54:57,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725952142] [2024-11-19 21:54:57,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:57,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:54:57,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:57,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:54:57,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:54:57,074 INFO L87 Difference]: Start difference. First operand 396 states and 602 transitions. Second operand has 12 states, 11 states have (on average 7.454545454545454) internal successors, (82), 8 states have internal predecessors, (82), 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-11-19 21:54:59,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:59,034 INFO L93 Difference]: Finished difference Result 954 states and 1467 transitions. [2024-11-19 21:54:59,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 21:54:59,034 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.454545454545454) internal successors, (82), 8 states have internal predecessors, (82), 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 119 [2024-11-19 21:54:59,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:59,037 INFO L225 Difference]: With dead ends: 954 [2024-11-19 21:54:59,037 INFO L226 Difference]: Without dead ends: 585 [2024-11-19 21:54:59,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-19 21:54:59,039 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 1077 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 4514 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 4861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 4514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:54:59,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 1622 Invalid, 4861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 4514 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 21:54:59,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-19 21:54:59,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 398. [2024-11-19 21:54:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 309 states have (on average 1.5177993527508091) internal successors, (469), 315 states have internal predecessors, (469), 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-11-19 21:54:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 608 transitions. [2024-11-19 21:54:59,063 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 608 transitions. Word has length 119 [2024-11-19 21:54:59,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:59,063 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 608 transitions. [2024-11-19 21:54:59,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.454545454545454) internal successors, (82), 8 states have internal predecessors, (82), 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-11-19 21:54:59,063 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 608 transitions. [2024-11-19 21:54:59,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-19 21:54:59,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:59,065 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:59,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 21:54:59,065 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:59,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:59,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1241782689, now seen corresponding path program 1 times [2024-11-19 21:54:59,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:59,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079259868] [2024-11-19 21:54:59,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:59,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:59,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:59,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:59,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:59,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:54:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:59,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:54:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:59,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:54:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:59,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 21:54:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:59,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 21:54:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:59,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-19 21:54:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:59,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 21:54:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:59,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:54:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:59,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-19 21:54:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:59,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-19 21:54:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-19 21:54:59,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:59,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079259868] [2024-11-19 21:54:59,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079259868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:59,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:54:59,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:54:59,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948349009] [2024-11-19 21:54:59,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:59,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:54:59,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:59,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:54:59,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:54:59,181 INFO L87 Difference]: Start difference. First operand 398 states and 608 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 5 states have internal predecessors, (80), 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-11-19 21:55:00,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:55:00,598 INFO L93 Difference]: Finished difference Result 956 states and 1470 transitions. [2024-11-19 21:55:00,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 21:55:00,600 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 5 states have internal predecessors, (80), 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 120 [2024-11-19 21:55:00,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:55:00,603 INFO L225 Difference]: With dead ends: 956 [2024-11-19 21:55:00,603 INFO L226 Difference]: Without dead ends: 585 [2024-11-19 21:55:00,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-11-19 21:55:00,606 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 1079 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 2706 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 3054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 2706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 21:55:00,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 1162 Invalid, 3054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 2706 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 21:55:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-19 21:55:00,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 398. [2024-11-19 21:55:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 309 states have (on average 1.5177993527508091) internal successors, (469), 315 states have internal predecessors, (469), 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-11-19 21:55:00,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 608 transitions. [2024-11-19 21:55:00,630 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 608 transitions. Word has length 120 [2024-11-19 21:55:00,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:55:00,630 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 608 transitions. [2024-11-19 21:55:00,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 5 states have internal predecessors, (80), 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-11-19 21:55:00,630 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 608 transitions. [2024-11-19 21:55:00,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-19 21:55:00,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:55:00,631 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:55:00,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 21:55:00,632 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:55:00,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:55:00,632 INFO L85 PathProgramCache]: Analyzing trace with hash 835554209, now seen corresponding path program 1 times [2024-11-19 21:55:00,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:55:00,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634899910] [2024-11-19 21:55:00,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:00,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:55:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:55:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:55:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:55:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:55:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:55:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:55:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 21:55:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 21:55:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-19 21:55:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 21:55:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:55:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-19 21:55:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-19 21:55:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,831 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 21:55:00,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:55:00,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634899910] [2024-11-19 21:55:00,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634899910] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:55:00,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957492987] [2024-11-19 21:55:00,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:00,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:55:00,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:55:00,833 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-11-19 21:55:00,835 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-11-19 21:55:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:01,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 21:55:01,031 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:55:01,067 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:55:01,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:55:01,149 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:55:01,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957492987] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:55:01,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:55:01,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-11-19 21:55:01,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275964808] [2024-11-19 21:55:01,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:55:01,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 21:55:01,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:55:01,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 21:55:01,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-19 21:55:01,151 INFO L87 Difference]: Start difference. First operand 398 states and 608 transitions. Second operand has 15 states, 14 states have (on average 9.714285714285714) internal successors, (136), 11 states have internal predecessors, (136), 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-11-19 21:55:03,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:55:03,241 INFO L93 Difference]: Finished difference Result 1329 states and 2138 transitions. [2024-11-19 21:55:03,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 21:55:03,242 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 9.714285714285714) internal successors, (136), 11 states have internal predecessors, (136), 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 120 [2024-11-19 21:55:03,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:55:03,246 INFO L225 Difference]: With dead ends: 1329 [2024-11-19 21:55:03,246 INFO L226 Difference]: Without dead ends: 962 [2024-11-19 21:55:03,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2024-11-19 21:55:03,248 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 2206 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 4895 mSolverCounterSat, 678 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2223 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 5573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 678 IncrementalHoareTripleChecker+Valid, 4895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:55:03,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2223 Valid, 1836 Invalid, 5573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [678 Valid, 4895 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 21:55:03,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-11-19 21:55:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 751. [2024-11-19 21:55:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 598 states have (on average 1.5719063545150502) internal successors, (940), 604 states have internal predecessors, (940), 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-11-19 21:55:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1217 transitions. [2024-11-19 21:55:03,278 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1217 transitions. Word has length 120 [2024-11-19 21:55:03,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:55:03,279 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1217 transitions. [2024-11-19 21:55:03,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 9.714285714285714) internal successors, (136), 11 states have internal predecessors, (136), 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-11-19 21:55:03,279 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1217 transitions. [2024-11-19 21:55:03,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-19 21:55:03,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:55:03,281 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-11-19 21:55:03,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 21:55:03,482 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-11-19 21:55:03,482 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:55:03,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:55:03,483 INFO L85 PathProgramCache]: Analyzing trace with hash -455326846, now seen corresponding path program 1 times [2024-11-19 21:55:03,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:55:03,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500169381] [2024-11-19 21:55:03,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:03,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:55:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:03,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:55:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:03,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:55:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:03,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:55:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:03,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:55:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:03,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:55:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:03,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:55:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:03,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-19 21:55:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:03,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:55:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:03,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:55:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:03,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:55:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:03,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-19 21:55:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:03,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-19 21:55:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:03,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-19 21:55:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:03,568 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:55:03,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:55:03,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500169381] [2024-11-19 21:55:03,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500169381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:55:03,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:55:03,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:55:03,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522509352] [2024-11-19 21:55:03,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:55:03,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:55:03,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:55:03,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:55:03,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:55:03,569 INFO L87 Difference]: Start difference. First operand 751 states and 1217 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-11-19 21:55:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:55:04,719 INFO L93 Difference]: Finished difference Result 1944 states and 3217 transitions. [2024-11-19 21:55:04,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:55:04,720 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-11-19 21:55:04,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:55:04,726 INFO L225 Difference]: With dead ends: 1944 [2024-11-19 21:55:04,726 INFO L226 Difference]: Without dead ends: 1271 [2024-11-19 21:55:04,728 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-11-19 21:55:04,728 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1187 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:55:04,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 864 Invalid, 1964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 21:55:04,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2024-11-19 21:55:04,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1076. [2024-11-19 21:55:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 859 states have (on average 1.589057043073341) internal successors, (1365), 865 states have internal predecessors, (1365), 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-11-19 21:55:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1780 transitions. [2024-11-19 21:55:04,770 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1780 transitions. Word has length 123 [2024-11-19 21:55:04,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:55:04,770 INFO L471 AbstractCegarLoop]: Abstraction has 1076 states and 1780 transitions. [2024-11-19 21:55:04,771 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-11-19 21:55:04,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1780 transitions. [2024-11-19 21:55:04,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 21:55:04,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:55:04,774 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-11-19 21:55:04,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 21:55:04,774 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:55:04,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:55:04,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1637464419, now seen corresponding path program 1 times [2024-11-19 21:55:04,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:55:04,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260063586] [2024-11-19 21:55:04,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:04,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:55:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:55:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:55:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:55:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:55:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:55:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:55:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-19 21:55:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:55:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:55:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-19 21:55:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:55:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-19 21:55:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-19 21:55:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:55:04,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:55:04,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260063586] [2024-11-19 21:55:04,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260063586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:55:04,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:55:04,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:55:04,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013691406] [2024-11-19 21:55:04,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:55:04,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:55:04,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:55:04,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:55:04,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:55:04,870 INFO L87 Difference]: Start difference. First operand 1076 states and 1780 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-11-19 21:55:05,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:55:05,899 INFO L93 Difference]: Finished difference Result 2749 states and 4601 transitions. [2024-11-19 21:55:05,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:55:05,900 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-11-19 21:55:05,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:55:05,907 INFO L225 Difference]: With dead ends: 2749 [2024-11-19 21:55:05,907 INFO L226 Difference]: Without dead ends: 1804 [2024-11-19 21:55:05,909 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-11-19 21:55:05,910 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1186 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:55:05,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 858 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 21:55:05,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2024-11-19 21:55:05,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1609. [2024-11-19 21:55:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1297 states have (on average 1.5967617579028528) internal successors, (2071), 1303 states have internal predecessors, (2071), 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-11-19 21:55:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2676 transitions. [2024-11-19 21:55:05,965 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2676 transitions. Word has length 124 [2024-11-19 21:55:05,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:55:05,967 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2676 transitions. [2024-11-19 21:55:05,968 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-11-19 21:55:05,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2676 transitions. [2024-11-19 21:55:05,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 21:55:05,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:55:05,973 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-11-19 21:55:05,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 21:55:05,974 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:55:05,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:55:05,974 INFO L85 PathProgramCache]: Analyzing trace with hash 311963568, now seen corresponding path program 1 times [2024-11-19 21:55:05,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:55:05,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154184918] [2024-11-19 21:55:05,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:05,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:55:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:06,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:55:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:06,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:55:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:06,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:55:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:06,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:55:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:06,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:55:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:06,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:55:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:06,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 21:55:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:06,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:55:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:06,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-19 21:55:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:06,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:55:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:06,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-19 21:55:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:06,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-19 21:55:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:06,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-19 21:55:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:06,061 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:55:06,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:55:06,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154184918] [2024-11-19 21:55:06,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154184918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:55:06,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:55:06,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:55:06,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818569994] [2024-11-19 21:55:06,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:55:06,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:55:06,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:55:06,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:55:06,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:55:06,063 INFO L87 Difference]: Start difference. First operand 1609 states and 2676 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (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-11-19 21:55:07,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:55:07,146 INFO L93 Difference]: Finished difference Result 3956 states and 6687 transitions. [2024-11-19 21:55:07,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:55:07,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (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 125 [2024-11-19 21:55:07,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:55:07,157 INFO L225 Difference]: With dead ends: 3956 [2024-11-19 21:55:07,157 INFO L226 Difference]: Without dead ends: 2613 [2024-11-19 21:55:07,160 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-11-19 21:55:07,161 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 1183 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:55:07,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 852 Invalid, 1939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 1545 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 21:55:07,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2613 states. [2024-11-19 21:55:07,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2613 to 2418. [2024-11-19 21:55:07,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 1983 states have (on average 1.6026222894604134) internal successors, (3178), 1989 states have internal predecessors, (3178), 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-11-19 21:55:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 4045 transitions. [2024-11-19 21:55:07,241 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 4045 transitions. Word has length 125 [2024-11-19 21:55:07,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:55:07,241 INFO L471 AbstractCegarLoop]: Abstraction has 2418 states and 4045 transitions. [2024-11-19 21:55:07,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (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-11-19 21:55:07,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 4045 transitions. [2024-11-19 21:55:07,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 21:55:07,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:55:07,248 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-11-19 21:55:07,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 21:55:07,248 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:55:07,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:55:07,248 INFO L85 PathProgramCache]: Analyzing trace with hash 920782558, now seen corresponding path program 1 times [2024-11-19 21:55:07,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:55:07,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622262178] [2024-11-19 21:55:07,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:07,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:55:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:07,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:55:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:07,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:55:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:07,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:55:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:07,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:55:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:07,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:55:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:07,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:55:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:07,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-19 21:55:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:07,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 21:55:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:07,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 21:55:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:07,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:55:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:07,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:55:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:07,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-19 21:55:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:07,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-19 21:55:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:07,333 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:55:07,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:55:07,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622262178] [2024-11-19 21:55:07,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622262178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:55:07,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:55:07,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:55:07,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184514222] [2024-11-19 21:55:07,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:55:07,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:55:07,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:55:07,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:55:07,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:55:07,336 INFO L87 Difference]: Start difference. First operand 2418 states and 4045 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 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-11-19 21:55:08,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:55:08,397 INFO L93 Difference]: Finished difference Result 5840 states and 9947 transitions. [2024-11-19 21:55:08,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:55:08,398 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 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 126 [2024-11-19 21:55:08,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:55:08,413 INFO L225 Difference]: With dead ends: 5840 [2024-11-19 21:55:08,413 INFO L226 Difference]: Without dead ends: 3907 [2024-11-19 21:55:08,417 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-11-19 21:55:08,418 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 1181 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:55:08,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 852 Invalid, 1939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 1545 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 21:55:08,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3907 states. [2024-11-19 21:55:08,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3907 to 3712. [2024-11-19 21:55:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3712 states, 3098 states have (on average 1.6061975468043899) internal successors, (4976), 3104 states have internal predecessors, (4976), 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-11-19 21:55:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 6227 transitions. [2024-11-19 21:55:08,561 INFO L78 Accepts]: Start accepts. Automaton has 3712 states and 6227 transitions. Word has length 126 [2024-11-19 21:55:08,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:55:08,561 INFO L471 AbstractCegarLoop]: Abstraction has 3712 states and 6227 transitions. [2024-11-19 21:55:08,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 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-11-19 21:55:08,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3712 states and 6227 transitions. [2024-11-19 21:55:08,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-19 21:55:08,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:55:08,569 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:55:08,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 21:55:08,570 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:55:08,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:55:08,570 INFO L85 PathProgramCache]: Analyzing trace with hash -309154676, now seen corresponding path program 1 times [2024-11-19 21:55:08,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:55:08,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811897787] [2024-11-19 21:55:08,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:08,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:55:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:55:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:55:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:55:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:55:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:55:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:55:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 21:55:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 21:55:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 21:55:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:55:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-19 21:55:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-19 21:55:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-19 21:55:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:55:08,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:55:08,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811897787] [2024-11-19 21:55:08,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811897787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:55:08,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:55:08,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:55:08,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724451142] [2024-11-19 21:55:08,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:55:08,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:55:08,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:55:08,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:55:08,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:55:08,661 INFO L87 Difference]: Start difference. First operand 3712 states and 6227 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 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-11-19 21:55:09,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:55:09,851 INFO L93 Difference]: Finished difference Result 8943 states and 15311 transitions. [2024-11-19 21:55:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:55:09,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 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 127 [2024-11-19 21:55:09,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:55:09,876 INFO L225 Difference]: With dead ends: 8943 [2024-11-19 21:55:09,877 INFO L226 Difference]: Without dead ends: 6048 [2024-11-19 21:55:09,882 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-11-19 21:55:09,883 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 1179 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:55:09,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 878 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1586 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 21:55:09,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6048 states. [2024-11-19 21:55:10,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6048 to 5853. [2024-11-19 21:55:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5853 states, 4863 states have (on average 1.6002467612584823) internal successors, (7782), 4869 states have internal predecessors, (7782), 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-11-19 21:55:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5853 states to 5853 states and 9829 transitions. [2024-11-19 21:55:10,062 INFO L78 Accepts]: Start accepts. Automaton has 5853 states and 9829 transitions. Word has length 127 [2024-11-19 21:55:10,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:55:10,062 INFO L471 AbstractCegarLoop]: Abstraction has 5853 states and 9829 transitions. [2024-11-19 21:55:10,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 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-11-19 21:55:10,063 INFO L276 IsEmpty]: Start isEmpty. Operand 5853 states and 9829 transitions. [2024-11-19 21:55:10,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 21:55:10,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:55:10,074 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:55:10,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 21:55:10,075 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:55:10,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:55:10,075 INFO L85 PathProgramCache]: Analyzing trace with hash 261739010, now seen corresponding path program 1 times [2024-11-19 21:55:10,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:55:10,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126708649] [2024-11-19 21:55:10,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:10,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:55:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:10,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:55:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:10,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:55:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:10,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:55:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:10,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:55:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:10,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:55:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:10,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:55:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:10,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:55:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:10,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:55:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:10,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-19 21:55:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:10,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-19 21:55:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:10,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 21:55:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:10,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-19 21:55:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:10,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-19 21:55:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:10,215 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:55:10,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:55:10,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126708649] [2024-11-19 21:55:10,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126708649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:55:10,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:55:10,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:55:10,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318286476] [2024-11-19 21:55:10,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:55:10,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:55:10,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:55:10,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:55:10,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:55:10,218 INFO L87 Difference]: Start difference. First operand 5853 states and 9829 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (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-11-19 21:55:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:55:11,537 INFO L93 Difference]: Finished difference Result 14560 states and 24924 transitions. [2024-11-19 21:55:11,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:55:11,538 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (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 128 [2024-11-19 21:55:11,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:55:11,571 INFO L225 Difference]: With dead ends: 14560 [2024-11-19 21:55:11,571 INFO L226 Difference]: Without dead ends: 9926 [2024-11-19 21:55:11,582 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-11-19 21:55:11,582 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1178 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 1555 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:55:11,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 867 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1555 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 21:55:11,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9926 states. [2024-11-19 21:55:11,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9926 to 9731. [2024-11-19 21:55:11,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9731 states, 8135 states have (on average 1.5981561155500923) internal successors, (13001), 8141 states have internal predecessors, (13001), 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-11-19 21:55:11,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9731 states to 9731 states and 16338 transitions. [2024-11-19 21:55:11,881 INFO L78 Accepts]: Start accepts. Automaton has 9731 states and 16338 transitions. Word has length 128 [2024-11-19 21:55:11,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:55:11,882 INFO L471 AbstractCegarLoop]: Abstraction has 9731 states and 16338 transitions. [2024-11-19 21:55:11,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (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-11-19 21:55:11,882 INFO L276 IsEmpty]: Start isEmpty. Operand 9731 states and 16338 transitions. [2024-11-19 21:55:11,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 21:55:11,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:55:11,899 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:55:11,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 21:55:11,900 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:55:11,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:55:11,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1891859226, now seen corresponding path program 1 times [2024-11-19 21:55:11,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:55:11,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084213527] [2024-11-19 21:55:11,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:11,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:55:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:11,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:55:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:11,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:55:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:11,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:55:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:11,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:55:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:11,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:55:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:11,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:55:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:11,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:55:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:11,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-19 21:55:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:11,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:55:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:11,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-19 21:55:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:11,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-19 21:55:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:11,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-19 21:55:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:11,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-19 21:55:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:55:11,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:55:11,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084213527] [2024-11-19 21:55:11,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084213527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:55:11,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:55:11,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:55:11,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727737635] [2024-11-19 21:55:11,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:55:11,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:55:11,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:55:11,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:55:11,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:55:11,991 INFO L87 Difference]: Start difference. First operand 9731 states and 16338 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (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-11-19 21:55:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:55:13,250 INFO L93 Difference]: Finished difference Result 25269 states and 43205 transitions. [2024-11-19 21:55:13,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:55:13,251 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (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 129 [2024-11-19 21:55:13,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:55:13,302 INFO L225 Difference]: With dead ends: 25269 [2024-11-19 21:55:13,302 INFO L226 Difference]: Without dead ends: 17239 [2024-11-19 21:55:13,325 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-11-19 21:55:13,326 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1176 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:55:13,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1191 Valid, 877 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 21:55:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17239 states. [2024-11-19 21:55:13,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17239 to 17044. [2024-11-19 21:55:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17044 states, 14245 states have (on average 1.5898209898209898) internal successors, (22647), 14251 states have internal predecessors, (22647), 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-11-19 21:55:14,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17044 states to 17044 states and 28534 transitions. [2024-11-19 21:55:14,035 INFO L78 Accepts]: Start accepts. Automaton has 17044 states and 28534 transitions. Word has length 129 [2024-11-19 21:55:14,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:55:14,035 INFO L471 AbstractCegarLoop]: Abstraction has 17044 states and 28534 transitions. [2024-11-19 21:55:14,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (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-11-19 21:55:14,036 INFO L276 IsEmpty]: Start isEmpty. Operand 17044 states and 28534 transitions. [2024-11-19 21:55:14,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-19 21:55:14,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:55:14,063 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:55:14,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 21:55:14,063 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:55:14,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:55:14,063 INFO L85 PathProgramCache]: Analyzing trace with hash 637643619, now seen corresponding path program 1 times [2024-11-19 21:55:14,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:55:14,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359183175] [2024-11-19 21:55:14,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:14,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:55:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:14,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:55:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:14,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:55:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:14,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:55:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:14,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:55:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:14,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:55:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:14,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:55:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:14,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:55:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:14,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:55:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:14,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-19 21:55:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:14,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-19 21:55:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:14,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-19 21:55:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:14,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-19 21:55:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:14,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-19 21:55:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:14,142 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:55:14,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:55:14,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359183175] [2024-11-19 21:55:14,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359183175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:55:14,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:55:14,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:55:14,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601114501] [2024-11-19 21:55:14,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:55:14,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:55:14,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:55:14,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:55:14,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:55:14,143 INFO L87 Difference]: Start difference. First operand 17044 states and 28534 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (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-11-19 21:55:15,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:55:15,594 INFO L93 Difference]: Finished difference Result 45245 states and 77218 transitions. [2024-11-19 21:55:15,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:55:15,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (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 130 [2024-11-19 21:55:15,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:55:15,690 INFO L225 Difference]: With dead ends: 45245 [2024-11-19 21:55:15,690 INFO L226 Difference]: Without dead ends: 30579 [2024-11-19 21:55:15,789 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-11-19 21:55:15,790 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 1174 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:55:15,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1189 Valid, 853 Invalid, 1948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 21:55:15,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30579 states. [2024-11-19 21:55:16,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30579 to 30384. [2024-11-19 21:55:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30384 states, 25546 states have (on average 1.585766851953339) internal successors, (40510), 25552 states have internal predecessors, (40510), 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-11-19 21:55:16,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30384 states to 30384 states and 50749 transitions. [2024-11-19 21:55:16,853 INFO L78 Accepts]: Start accepts. Automaton has 30384 states and 50749 transitions. Word has length 130 [2024-11-19 21:55:16,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:55:16,855 INFO L471 AbstractCegarLoop]: Abstraction has 30384 states and 50749 transitions. [2024-11-19 21:55:16,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (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-11-19 21:55:16,856 INFO L276 IsEmpty]: Start isEmpty. Operand 30384 states and 50749 transitions. [2024-11-19 21:55:16,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 21:55:16,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:55:16,882 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:55:16,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 21:55:16,882 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:55:16,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:55:16,883 INFO L85 PathProgramCache]: Analyzing trace with hash -138218980, now seen corresponding path program 1 times [2024-11-19 21:55:16,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:55:16,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093576716] [2024-11-19 21:55:16,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:16,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:55:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:55:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:55:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:55:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:55:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:55:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:55:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 21:55:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:55:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:55:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:55:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-19 21:55:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-19 21:55:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-19 21:55:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,987 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:55:16,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:55:16,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093576716] [2024-11-19 21:55:16,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093576716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:55:16,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:55:16,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:55:16,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625464678] [2024-11-19 21:55:16,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:55:16,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:55:16,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:55:16,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:55:16,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:55:16,990 INFO L87 Difference]: Start difference. First operand 30384 states and 50749 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 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-11-19 21:55:19,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:55:19,138 INFO L93 Difference]: Finished difference Result 82982 states and 140742 transitions. [2024-11-19 21:55:19,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:55:19,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 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 131 [2024-11-19 21:55:19,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:55:19,292 INFO L225 Difference]: With dead ends: 82982 [2024-11-19 21:55:19,292 INFO L226 Difference]: Without dead ends: 55788 [2024-11-19 21:55:19,349 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-11-19 21:55:19,350 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1172 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 1548 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 1952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:55:19,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 865 Invalid, 1952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1548 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 21:55:19,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55788 states. [2024-11-19 21:55:20,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55788 to 55593. [2024-11-19 21:55:20,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55593 states, 47040 states have (on average 1.5803784013605442) internal successors, (74341), 47046 states have internal predecessors, (74341), 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-11-19 21:55:21,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55593 states to 55593 states and 92542 transitions. [2024-11-19 21:55:21,152 INFO L78 Accepts]: Start accepts. Automaton has 55593 states and 92542 transitions. Word has length 131 [2024-11-19 21:55:21,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:55:21,152 INFO L471 AbstractCegarLoop]: Abstraction has 55593 states and 92542 transitions. [2024-11-19 21:55:21,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 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-11-19 21:55:21,152 INFO L276 IsEmpty]: Start isEmpty. Operand 55593 states and 92542 transitions. [2024-11-19 21:55:21,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 21:55:21,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:55:21,182 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:55:21,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 21:55:21,182 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:55:21,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:55:21,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1072047901, now seen corresponding path program 1 times [2024-11-19 21:55:21,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:55:21,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717688045] [2024-11-19 21:55:21,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:21,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:55:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:21,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:55:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:21,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:55:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:21,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:55:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:21,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:55:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:21,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:55:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:21,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:55:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:21,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 21:55:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:21,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:55:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:21,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:55:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:21,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-19 21:55:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:21,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-19 21:55:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:21,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-19 21:55:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:21,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-19 21:55:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:55:21,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:55:21,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717688045] [2024-11-19 21:55:21,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717688045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:55:21,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:55:21,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:55:21,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510675895] [2024-11-19 21:55:21,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:55:21,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:55:21,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:55:21,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:55:21,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:55:21,282 INFO L87 Difference]: Start difference. First operand 55593 states and 92542 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (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-11-19 21:55:24,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:55:24,300 INFO L93 Difference]: Finished difference Result 104038 states and 176728 transitions. [2024-11-19 21:55:24,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:55:24,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (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 132 [2024-11-19 21:55:24,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:55:24,658 INFO L225 Difference]: With dead ends: 104038 [2024-11-19 21:55:24,659 INFO L226 Difference]: Without dead ends: 103862 [2024-11-19 21:55:24,700 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-11-19 21:55:24,701 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1167 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:55:24,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 891 Invalid, 1944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 1549 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 21:55:24,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103862 states. [2024-11-19 21:55:27,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103862 to 103667. [2024-11-19 21:55:27,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103667 states, 88315 states have (on average 1.5735945196172791) internal successors, (138972), 88321 states have internal predecessors, (138972), 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-11-19 21:55:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103667 states to 103667 states and 171817 transitions. [2024-11-19 21:55:28,098 INFO L78 Accepts]: Start accepts. Automaton has 103667 states and 171817 transitions. Word has length 132 [2024-11-19 21:55:28,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:55:28,098 INFO L471 AbstractCegarLoop]: Abstraction has 103667 states and 171817 transitions. [2024-11-19 21:55:28,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (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-11-19 21:55:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 103667 states and 171817 transitions. [2024-11-19 21:55:28,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 21:55:28,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:55:28,133 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:55:28,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 21:55:28,133 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:55:28,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:55:28,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1752864827, now seen corresponding path program 1 times [2024-11-19 21:55:28,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:55:28,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162693958] [2024-11-19 21:55:28,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:28,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:55:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:28,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:55:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:28,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:55:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:28,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:55:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:28,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:55:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:28,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:55:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:28,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:55:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:28,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:55:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:28,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:55:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:28,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:55:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:28,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:55:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:28,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-19 21:55:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:28,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-19 21:55:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:28,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-19 21:55:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:55:28,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:55:28,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162693958] [2024-11-19 21:55:28,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162693958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:55:28,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:55:28,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 21:55:28,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48836211] [2024-11-19 21:55:28,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:55:28,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 21:55:28,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:55:28,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 21:55:28,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:55:28,401 INFO L87 Difference]: Start difference. First operand 103667 states and 171817 transitions. Second operand has 13 states, 13 states have (on average 7.0) internal successors, (91), 8 states have internal predecessors, (91), 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-11-19 21:55:34,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:55:34,369 INFO L93 Difference]: Finished difference Result 104991 states and 177065 transitions. [2024-11-19 21:55:34,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-19 21:55:34,369 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 8 states have internal predecessors, (91), 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 133 [2024-11-19 21:55:34,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:55:34,718 INFO L225 Difference]: With dead ends: 104991 [2024-11-19 21:55:34,718 INFO L226 Difference]: Without dead ends: 104821 [2024-11-19 21:55:34,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=399, Invalid=1323, Unknown=0, NotChecked=0, Total=1722 [2024-11-19 21:55:34,751 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 2736 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 7841 mSolverCounterSat, 805 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2736 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 8646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 805 IncrementalHoareTripleChecker+Valid, 7841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-19 21:55:34,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2736 Valid, 1306 Invalid, 8646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [805 Valid, 7841 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-19 21:55:34,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104821 states. [2024-11-19 21:55:37,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104821 to 104138. [2024-11-19 21:55:38,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104138 states, 88685 states have (on average 1.5729943056886735) internal successors, (139501), 88694 states have internal predecessors, (139501), 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-11-19 21:55:38,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104138 states to 104138 states and 172480 transitions. [2024-11-19 21:55:38,289 INFO L78 Accepts]: Start accepts. Automaton has 104138 states and 172480 transitions. Word has length 133 [2024-11-19 21:55:38,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:55:38,290 INFO L471 AbstractCegarLoop]: Abstraction has 104138 states and 172480 transitions. [2024-11-19 21:55:38,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 8 states have internal predecessors, (91), 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-11-19 21:55:38,290 INFO L276 IsEmpty]: Start isEmpty. Operand 104138 states and 172480 transitions. [2024-11-19 21:55:38,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 21:55:38,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:55:38,329 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:55:38,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 21:55:38,329 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:55:38,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:55:38,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1126944471, now seen corresponding path program 1 times [2024-11-19 21:55:38,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:55:38,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413412633] [2024-11-19 21:55:38,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:38,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:55:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:38,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:55:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:38,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:55:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:38,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:55:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:38,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:55:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:38,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:55:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:38,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:55:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:38,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:55:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:38,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:55:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:38,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:55:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:38,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:55:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:38,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-19 21:55:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:38,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-19 21:55:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:38,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-19 21:55:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:55:38,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:55:38,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413412633] [2024-11-19 21:55:38,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413412633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:55:38,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:55:38,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 21:55:38,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567165324] [2024-11-19 21:55:38,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:55:38,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 21:55:38,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:55:38,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 21:55:38,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-11-19 21:55:38,980 INFO L87 Difference]: Start difference. First operand 104138 states and 172480 transitions. Second operand has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 10 states have internal predecessors, (92), 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) [2024-11-19 21:55:44,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:55:44,207 INFO L93 Difference]: Finished difference Result 106121 states and 178752 transitions. [2024-11-19 21:55:44,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-19 21:55:44,208 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 10 states have internal predecessors, (92), 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) Word has length 134 [2024-11-19 21:55:44,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:55:44,535 INFO L225 Difference]: With dead ends: 106121 [2024-11-19 21:55:44,535 INFO L226 Difference]: Without dead ends: 104610 [2024-11-19 21:55:44,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=1636, Unknown=0, NotChecked=0, Total=1980 [2024-11-19 21:55:44,572 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1765 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 7223 mSolverCounterSat, 597 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1765 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 7820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 597 IncrementalHoareTripleChecker+Valid, 7223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-19 21:55:44,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1765 Valid, 2095 Invalid, 7820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [597 Valid, 7223 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-19 21:55:44,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104610 states. [2024-11-19 21:55:47,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104610 to 104068. [2024-11-19 21:55:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104068 states, 88631 states have (on average 1.5731177578950932) internal successors, (139427), 88641 states have internal predecessors, (139427), 15381 states have call successors, (15381), 48 states have call predecessors, (15381), 55 states have return successors, (17579), 15378 states have call predecessors, (17579), 15376 states have call successors, (17579) [2024-11-19 21:55:48,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104068 states to 104068 states and 172387 transitions. [2024-11-19 21:55:48,231 INFO L78 Accepts]: Start accepts. Automaton has 104068 states and 172387 transitions. Word has length 134 [2024-11-19 21:55:48,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:55:48,232 INFO L471 AbstractCegarLoop]: Abstraction has 104068 states and 172387 transitions. [2024-11-19 21:55:48,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 10 states have internal predecessors, (92), 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) [2024-11-19 21:55:48,232 INFO L276 IsEmpty]: Start isEmpty. Operand 104068 states and 172387 transitions. [2024-11-19 21:55:48,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 21:55:48,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:55:48,263 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:55:48,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 21:55:48,264 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:55:48,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:55:48,264 INFO L85 PathProgramCache]: Analyzing trace with hash -212573307, now seen corresponding path program 1 times [2024-11-19 21:55:48,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:55:48,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037430341] [2024-11-19 21:55:48,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:48,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:55:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:48,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:55:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:48,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:55:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:48,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:55:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:48,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:55:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:48,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:55:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:48,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:55:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:48,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:55:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:48,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:55:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:48,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:55:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:48,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-19 21:55:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:48,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-19 21:55:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:48,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-19 21:55:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:48,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-19 21:55:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 21:55:48,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:55:48,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037430341] [2024-11-19 21:55:48,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037430341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:55:48,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975117691] [2024-11-19 21:55:48,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:48,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:55:48,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:55:48,950 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:55:48,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 21:55:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:49,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 21:55:49,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:55:49,444 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 21:55:49,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:55:49,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975117691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:55:49,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:55:49,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [20] total 31 [2024-11-19 21:55:49,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694916578] [2024-11-19 21:55:49,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:55:49,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 21:55:49,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:55:49,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 21:55:49,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=857, Unknown=0, NotChecked=0, Total=930 [2024-11-19 21:55:49,447 INFO L87 Difference]: Start difference. First operand 104068 states and 172387 transitions. Second operand has 13 states, 12 states have (on average 8.5) internal successors, (102), 11 states have internal predecessors, (102), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-19 21:55:52,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:55:52,109 INFO L93 Difference]: Finished difference Result 104933 states and 173609 transitions. [2024-11-19 21:55:52,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 21:55:52,109 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.5) internal successors, (102), 11 states have internal predecessors, (102), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) Word has length 137 [2024-11-19 21:55:52,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:55:52,426 INFO L225 Difference]: With dead ends: 104933 [2024-11-19 21:55:52,426 INFO L226 Difference]: Without dead ends: 104741 [2024-11-19 21:55:52,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=1870, Unknown=0, NotChecked=0, Total=2070 [2024-11-19 21:55:52,471 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 799 mSDsluCounter, 4795 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 5323 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 21:55:52,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 5323 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 21:55:52,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104741 states. [2024-11-19 21:55:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104741 to 104658. [2024-11-19 21:55:55,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104658 states, 89089 states have (on average 1.5723602240456174) internal successors, (140080), 89110 states have internal predecessors, (140080), 15463 states have call successors, (15463), 87 states have call predecessors, (15463), 105 states have return successors, (17690), 15460 states have call predecessors, (17690), 15455 states have call successors, (17690) [2024-11-19 21:55:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104658 states to 104658 states and 173233 transitions. [2024-11-19 21:55:55,740 INFO L78 Accepts]: Start accepts. Automaton has 104658 states and 173233 transitions. Word has length 137 [2024-11-19 21:55:55,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:55:55,740 INFO L471 AbstractCegarLoop]: Abstraction has 104658 states and 173233 transitions. [2024-11-19 21:55:55,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.5) internal successors, (102), 11 states have internal predecessors, (102), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-19 21:55:55,741 INFO L276 IsEmpty]: Start isEmpty. Operand 104658 states and 173233 transitions. [2024-11-19 21:55:55,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-19 21:55:55,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:55:55,779 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:55:55,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 21:55:55,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:55:55,980 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:55:55,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:55:55,980 INFO L85 PathProgramCache]: Analyzing trace with hash -256703627, now seen corresponding path program 1 times [2024-11-19 21:55:55,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:55:55,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694794659] [2024-11-19 21:55:55,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:55,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:55:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat