./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product18.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product18.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 f70ac21a1decd51d5f9571a5be4450629a9ca28f5aa1158e9564f33ba44bf6ef --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:01:44,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:01:44,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:01:44,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:01:44,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:01:44,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:01:44,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:01:44,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:01:44,421 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:01:44,421 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:01:44,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:01:44,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:01:44,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:01:44,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:01:44,423 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:01:44,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:01:44,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:01:44,424 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:01:44,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:01:44,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:01:44,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:01:44,427 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:01:44,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:01:44,428 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:01:44,428 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:01:44,430 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:01:44,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:01:44,430 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:01:44,431 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:01:44,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:01:44,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:01:44,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:01:44,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:01:44,431 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:01:44,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:01:44,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:01:44,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:01:44,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:01:44,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:01:44,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:01:44,433 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:01:44,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:01:44,435 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 -> f70ac21a1decd51d5f9571a5be4450629a9ca28f5aa1158e9564f33ba44bf6ef [2024-10-14 03:01:44,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:01:44,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:01:44,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:01:44,700 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:01:44,700 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:01:44,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product18.cil.c [2024-10-14 03:01:45,917 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:01:46,174 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:01:46,175 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product18.cil.c [2024-10-14 03:01:46,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c48d8a419/d23fa5d3bd1a4510873227c9fafcea25/FLAGe2ca09aa5 [2024-10-14 03:01:46,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c48d8a419/d23fa5d3bd1a4510873227c9fafcea25 [2024-10-14 03:01:46,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:01:46,210 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:01:46,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:01:46,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:01:46,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:01:46,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:01:46" (1/1) ... [2024-10-14 03:01:46,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a562383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:01:46, skipping insertion in model container [2024-10-14 03:01:46,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:01:46" (1/1) ... [2024-10-14 03:01:46,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:01:46,625 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product18.cil.c[45803,45816] [2024-10-14 03:01:46,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:01:46,687 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:01:46,695 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2024-10-14 03:01:46,696 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [66] [2024-10-14 03:01:46,696 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [432] [2024-10-14 03:01:46,696 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [481] [2024-10-14 03:01:46,697 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1561] [2024-10-14 03:01:46,697 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1973] [2024-10-14 03:01:46,697 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1982] [2024-10-14 03:01:46,697 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2274] [2024-10-14 03:01:46,697 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2373] [2024-10-14 03:01:46,697 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2658] [2024-10-14 03:01:46,697 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptVerify_spec.i","") [2874] [2024-10-14 03:01:46,750 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product18.cil.c[45803,45816] [2024-10-14 03:01:46,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:01:46,798 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:01:46,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:01:46 WrapperNode [2024-10-14 03:01:46,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:01:46,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:01:46,799 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:01:46,799 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:01:46,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:01:46" (1/1) ... [2024-10-14 03:01:46,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:01:46" (1/1) ... [2024-10-14 03:01:46,866 INFO L138 Inliner]: procedures = 127, calls = 184, calls flagged for inlining = 59, calls inlined = 50, statements flattened = 906 [2024-10-14 03:01:46,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:01:46,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:01:46,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:01:46,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:01:46,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:01:46" (1/1) ... [2024-10-14 03:01:46,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:01:46" (1/1) ... [2024-10-14 03:01:46,884 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:01:46" (1/1) ... [2024-10-14 03:01:46,909 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-10-14 03:01:46,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:01:46" (1/1) ... [2024-10-14 03:01:46,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:01:46" (1/1) ... [2024-10-14 03:01:46,927 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:01:46" (1/1) ... [2024-10-14 03:01:46,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:01:46" (1/1) ... [2024-10-14 03:01:46,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:01:46" (1/1) ... [2024-10-14 03:01:46,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:01:46" (1/1) ... [2024-10-14 03:01:46,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:01:46,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:01:46,964 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:01:46,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:01:46,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:01:46" (1/1) ... [2024-10-14 03:01:46,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:01:46,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:01:47,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:01:47,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:01:47,047 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-14 03:01:47,047 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-14 03:01:47,047 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-14 03:01:47,047 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-14 03:01:47,047 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-14 03:01:47,048 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-14 03:01:47,048 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-14 03:01:47,048 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-14 03:01:47,048 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-14 03:01:47,049 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-14 03:01:47,049 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-14 03:01:47,049 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-14 03:01:47,049 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-14 03:01:47,049 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-14 03:01:47,049 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-14 03:01:47,050 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-14 03:01:47,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:01:47,050 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-14 03:01:47,050 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-14 03:01:47,050 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-14 03:01:47,050 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-14 03:01:47,050 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-14 03:01:47,050 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-14 03:01:47,050 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-14 03:01:47,051 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-14 03:01:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-14 03:01:47,051 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-14 03:01:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-14 03:01:47,051 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-14 03:01:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-14 03:01:47,051 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-14 03:01:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:01:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 03:01:47,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 03:01:47,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 03:01:47,052 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-14 03:01:47,052 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-14 03:01:47,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:01:47,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:01:47,216 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:01:47,224 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:01:47,825 INFO L? ?]: Removed 393 outVars from TransFormulas that were not future-live. [2024-10-14 03:01:47,825 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:01:47,866 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:01:47,866 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 03:01:47,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:01:47 BoogieIcfgContainer [2024-10-14 03:01:47,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:01:47,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:01:47,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:01:47,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:01:47,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:01:46" (1/3) ... [2024-10-14 03:01:47,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134b6351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:01:47, skipping insertion in model container [2024-10-14 03:01:47,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:01:46" (2/3) ... [2024-10-14 03:01:47,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@134b6351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:01:47, skipping insertion in model container [2024-10-14 03:01:47,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:01:47" (3/3) ... [2024-10-14 03:01:47,873 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec7_product18.cil.c [2024-10-14 03:01:47,890 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:01:47,890 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:01:47,992 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:01:48,001 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;@5329d00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:01:48,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:01:48,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 259 states, 203 states have (on average 1.6157635467980296) internal successors, (328), 205 states have internal predecessors, (328), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-14 03:01:48,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:01:48,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:01:48,055 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] [2024-10-14 03:01:48,056 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:01:48,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:01:48,061 INFO L85 PathProgramCache]: Analyzing trace with hash 828068327, now seen corresponding path program 1 times [2024-10-14 03:01:48,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:01:48,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973919899] [2024-10-14 03:01:48,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:01:48,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:01:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:48,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:01:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:48,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:01:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:48,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:01:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:48,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:01:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:48,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:01:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:48,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:01:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:48,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:01:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:48,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 03:01:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:48,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 03:01:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:48,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:01:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:48,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 03:01:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 03:01:48,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:01:48,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973919899] [2024-10-14 03:01:48,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973919899] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:01:48,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906237833] [2024-10-14 03:01:48,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:01:48,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:01:48,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:01:48,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:01:48,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:01:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:48,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 03:01:48,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:01:48,898 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 03:01:48,899 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:01:48,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906237833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:01:48,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:01:48,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-14 03:01:48,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355641695] [2024-10-14 03:01:48,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:01:48,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:01:48,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:01:48,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:01:48,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:01:48,935 INFO L87 Difference]: Start difference. First operand has 259 states, 203 states have (on average 1.6157635467980296) internal successors, (328), 205 states have internal predecessors, (328), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:01:48,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:01:48,999 INFO L93 Difference]: Finished difference Result 373 states and 571 transitions. [2024-10-14 03:01:49,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:01:49,001 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 79 [2024-10-14 03:01:49,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:01:49,014 INFO L225 Difference]: With dead ends: 373 [2024-10-14 03:01:49,014 INFO L226 Difference]: Without dead ends: 256 [2024-10-14 03:01:49,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:01:49,023 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:01:49,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:01:49,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-14 03:01:49,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2024-10-14 03:01:49,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 201 states have (on average 1.5970149253731343) internal successors, (321), 202 states have internal predecessors, (321), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-14 03:01:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 396 transitions. [2024-10-14 03:01:49,082 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 396 transitions. Word has length 79 [2024-10-14 03:01:49,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:01:49,084 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 396 transitions. [2024-10-14 03:01:49,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:01:49,084 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 396 transitions. [2024-10-14 03:01:49,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 03:01:49,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:01:49,088 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] [2024-10-14 03:01:49,104 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-10-14 03:01:49,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-14 03:01:49,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:01:49,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:01:49,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1144118604, now seen corresponding path program 1 times [2024-10-14 03:01:49,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:01:49,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309810759] [2024-10-14 03:01:49,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:01:49,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:01:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:49,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:01:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:49,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:01:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:49,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:01:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:49,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:01:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:49,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:01:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:49,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:01:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:49,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 03:01:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:49,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 03:01:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:49,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 03:01:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:49,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:01:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:49,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 03:01:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:49,543 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 03:01:49,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:01:49,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309810759] [2024-10-14 03:01:49,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309810759] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:01:49,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145356736] [2024-10-14 03:01:49,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:01:49,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:01:49,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:01:49,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:01:49,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 03:01:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:49,744 INFO L255 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 03:01:49,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:01:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 03:01:49,775 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:01:49,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145356736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:01:49,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:01:49,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-14 03:01:49,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714720039] [2024-10-14 03:01:49,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:01:49,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:01:49,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:01:49,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:01:49,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:01:49,778 INFO L87 Difference]: Start difference. First operand 256 states and 396 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:01:49,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:01:49,835 INFO L93 Difference]: Finished difference Result 369 states and 558 transitions. [2024-10-14 03:01:49,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:01:49,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 80 [2024-10-14 03:01:49,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:01:49,840 INFO L225 Difference]: With dead ends: 369 [2024-10-14 03:01:49,840 INFO L226 Difference]: Without dead ends: 258 [2024-10-14 03:01:49,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:01:49,844 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 0 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:01:49,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 767 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:01:49,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-14 03:01:49,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-10-14 03:01:49,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 203 states have (on average 1.5911330049261083) internal successors, (323), 204 states have internal predecessors, (323), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-14 03:01:49,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 398 transitions. [2024-10-14 03:01:49,866 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 398 transitions. Word has length 80 [2024-10-14 03:01:49,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:01:49,866 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 398 transitions. [2024-10-14 03:01:49,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:01:49,867 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 398 transitions. [2024-10-14 03:01:49,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 03:01:49,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:01:49,872 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] [2024-10-14 03:01:49,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 03:01:50,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-14 03:01:50,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:01:50,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:01:50,074 INFO L85 PathProgramCache]: Analyzing trace with hash -968189616, now seen corresponding path program 1 times [2024-10-14 03:01:50,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:01:50,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710049173] [2024-10-14 03:01:50,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:01:50,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:01:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:01:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:01:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:01:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:01:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:01:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:01:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 03:01:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 03:01:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 03:01:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:01:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 03:01:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,276 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 03:01:50,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:01:50,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710049173] [2024-10-14 03:01:50,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710049173] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:01:50,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213318427] [2024-10-14 03:01:50,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:01:50,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:01:50,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:01:50,279 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:01:50,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 03:01:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 03:01:50,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:01:50,501 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 03:01:50,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:01:50,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213318427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:01:50,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:01:50,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-14 03:01:50,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819896319] [2024-10-14 03:01:50,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:01:50,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:01:50,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:01:50,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:01:50,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:01:50,504 INFO L87 Difference]: Start difference. First operand 258 states and 398 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:01:50,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:01:50,547 INFO L93 Difference]: Finished difference Result 546 states and 855 transitions. [2024-10-14 03:01:50,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:01:50,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 87 [2024-10-14 03:01:50,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:01:50,550 INFO L225 Difference]: With dead ends: 546 [2024-10-14 03:01:50,550 INFO L226 Difference]: Without dead ends: 310 [2024-10-14 03:01:50,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 104 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-10-14 03:01:50,553 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 102 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:01:50,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 725 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:01:50,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-10-14 03:01:50,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 305. [2024-10-14 03:01:50,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 239 states have (on average 1.602510460251046) internal successors, (383), 240 states have internal predecessors, (383), 49 states have call successors, (49), 16 states have call predecessors, (49), 16 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 03:01:50,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 480 transitions. [2024-10-14 03:01:50,574 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 480 transitions. Word has length 87 [2024-10-14 03:01:50,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:01:50,575 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 480 transitions. [2024-10-14 03:01:50,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:01:50,575 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 480 transitions. [2024-10-14 03:01:50,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-14 03:01:50,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:01:50,576 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] [2024-10-14 03:01:50,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 03:01:50,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:01:50,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:01:50,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:01:50,778 INFO L85 PathProgramCache]: Analyzing trace with hash -713025711, now seen corresponding path program 1 times [2024-10-14 03:01:50,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:01:50,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484695501] [2024-10-14 03:01:50,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:01:50,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:01:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:01:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:01:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:01:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:01:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 03:01:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 03:01:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 03:01:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 03:01:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 03:01:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:01:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 03:01:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 03:01:50,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:01:50,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484695501] [2024-10-14 03:01:50,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484695501] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:01:50,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443517415] [2024-10-14 03:01:50,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:01:50,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:01:50,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:01:50,959 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:01:50,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 03:01:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:51,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 03:01:51,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:01:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 03:01:51,215 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:01:51,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443517415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:01:51,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:01:51,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-14 03:01:51,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122439696] [2024-10-14 03:01:51,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:01:51,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:01:51,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:01:51,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:01:51,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:01:51,218 INFO L87 Difference]: Start difference. First operand 305 states and 480 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 03:01:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:01:51,307 INFO L93 Difference]: Finished difference Result 605 states and 954 transitions. [2024-10-14 03:01:51,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:01:51,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 88 [2024-10-14 03:01:51,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:01:51,314 INFO L225 Difference]: With dead ends: 605 [2024-10-14 03:01:51,314 INFO L226 Difference]: Without dead ends: 307 [2024-10-14 03:01:51,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:01:51,315 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 2 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:01:51,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1493 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:01:51,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-14 03:01:51,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-10-14 03:01:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 240 states have (on average 1.6) internal successors, (384), 242 states have internal predecessors, (384), 49 states have call successors, (49), 16 states have call predecessors, (49), 17 states have return successors, (50), 48 states have call predecessors, (50), 48 states have call successors, (50) [2024-10-14 03:01:51,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 483 transitions. [2024-10-14 03:01:51,332 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 483 transitions. Word has length 88 [2024-10-14 03:01:51,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:01:51,332 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 483 transitions. [2024-10-14 03:01:51,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 03:01:51,333 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 483 transitions. [2024-10-14 03:01:51,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 03:01:51,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:01:51,334 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] [2024-10-14 03:01:51,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 03:01:51,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:01:51,535 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:01:51,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:01:51,535 INFO L85 PathProgramCache]: Analyzing trace with hash -164249190, now seen corresponding path program 1 times [2024-10-14 03:01:51,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:01:51,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883212445] [2024-10-14 03:01:51,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:01:51,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:01:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:51,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:01:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:51,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:01:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:51,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:01:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:51,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:01:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:51,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 03:01:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:51,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 03:01:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:51,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 03:01:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:51,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 03:01:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:51,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 03:01:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:51,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 03:01:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:51,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 03:01:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-14 03:01:51,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:01:51,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883212445] [2024-10-14 03:01:51,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883212445] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:01:51,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630215792] [2024-10-14 03:01:51,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:01:51,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:01:51,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:01:51,748 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:01:51,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 03:01:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:51,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 942 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 03:01:51,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:01:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 03:01:51,986 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:01:51,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630215792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:01:51,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:01:51,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-14 03:01:51,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954288822] [2024-10-14 03:01:51,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:01:51,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:01:51,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:01:51,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:01:51,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:01:51,988 INFO L87 Difference]: Start difference. First operand 307 states and 483 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 03:01:52,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:01:52,056 INFO L93 Difference]: Finished difference Result 607 states and 959 transitions. [2024-10-14 03:01:52,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:01:52,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 89 [2024-10-14 03:01:52,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:01:52,058 INFO L225 Difference]: With dead ends: 607 [2024-10-14 03:01:52,059 INFO L226 Difference]: Without dead ends: 309 [2024-10-14 03:01:52,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:01:52,060 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 2 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:01:52,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1479 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:01:52,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-14 03:01:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-10-14 03:01:52,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 241 states have (on average 1.5975103734439835) internal successors, (385), 244 states have internal predecessors, (385), 49 states have call successors, (49), 16 states have call predecessors, (49), 18 states have return successors, (55), 48 states have call predecessors, (55), 48 states have call successors, (55) [2024-10-14 03:01:52,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 489 transitions. [2024-10-14 03:01:52,077 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 489 transitions. Word has length 89 [2024-10-14 03:01:52,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:01:52,077 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 489 transitions. [2024-10-14 03:01:52,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 03:01:52,078 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 489 transitions. [2024-10-14 03:01:52,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 03:01:52,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:01:52,079 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] [2024-10-14 03:01:52,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-14 03:01:52,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:01:52,280 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:01:52,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:01:52,281 INFO L85 PathProgramCache]: Analyzing trace with hash -246379591, now seen corresponding path program 1 times [2024-10-14 03:01:52,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:01:52,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412417463] [2024-10-14 03:01:52,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:01:52,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:01:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:52,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:01:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:52,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:01:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:52,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:01:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:52,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:01:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:52,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:01:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:52,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:01:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:52,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 03:01:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:52,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 03:01:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:52,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 03:01:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:52,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 03:01:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:52,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 03:01:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:52,452 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 03:01:52,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:01:52,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412417463] [2024-10-14 03:01:52,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412417463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:01:52,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:01:52,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 03:01:52,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000336609] [2024-10-14 03:01:52,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:01:52,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 03:01:52,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:01:52,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 03:01:52,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:01:52,454 INFO L87 Difference]: Start difference. First operand 309 states and 489 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 03:01:53,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:01:53,691 INFO L93 Difference]: Finished difference Result 677 states and 1084 transitions. [2024-10-14 03:01:53,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:01:53,691 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2024-10-14 03:01:53,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:01:53,693 INFO L225 Difference]: With dead ends: 677 [2024-10-14 03:01:53,693 INFO L226 Difference]: Without dead ends: 387 [2024-10-14 03:01:53,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 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-10-14 03:01:53,695 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 826 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:01:53,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 968 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 03:01:53,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-10-14 03:01:53,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 309. [2024-10-14 03:01:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 241 states have (on average 1.5975103734439835) internal successors, (385), 244 states have internal predecessors, (385), 49 states have call successors, (49), 16 states have call predecessors, (49), 18 states have return successors, (54), 48 states have call predecessors, (54), 48 states have call successors, (54) [2024-10-14 03:01:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 488 transitions. [2024-10-14 03:01:53,714 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 488 transitions. Word has length 90 [2024-10-14 03:01:53,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:01:53,714 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 488 transitions. [2024-10-14 03:01:53,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 03:01:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 488 transitions. [2024-10-14 03:01:53,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 03:01:53,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:01:53,715 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] [2024-10-14 03:01:53,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:01:53,716 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:01:53,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:01:53,716 INFO L85 PathProgramCache]: Analyzing trace with hash 892234980, now seen corresponding path program 2 times [2024-10-14 03:01:53,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:01:53,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801028012] [2024-10-14 03:01:53,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:01:53,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:01:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:53,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:01:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:53,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:01:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:53,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:01:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:53,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:01:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:53,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:01:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:53,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:01:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:53,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-14 03:01:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:53,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 03:01:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:53,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 03:01:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:53,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 03:01:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:53,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 03:01:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:53,854 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 03:01:53,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:01:53,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801028012] [2024-10-14 03:01:53,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801028012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:01:53,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:01:53,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 03:01:53,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528974258] [2024-10-14 03:01:53,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:01:53,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 03:01:53,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:01:53,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 03:01:53,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:01:53,856 INFO L87 Difference]: Start difference. First operand 309 states and 488 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 03:01:55,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:01:55,052 INFO L93 Difference]: Finished difference Result 679 states and 1087 transitions. [2024-10-14 03:01:55,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:01:55,052 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 91 [2024-10-14 03:01:55,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:01:55,055 INFO L225 Difference]: With dead ends: 679 [2024-10-14 03:01:55,055 INFO L226 Difference]: Without dead ends: 389 [2024-10-14 03:01:55,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 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-10-14 03:01:55,058 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 822 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:01:55,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 968 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1808 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 03:01:55,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-14 03:01:55,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 311. [2024-10-14 03:01:55,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 242 states have (on average 1.5950413223140496) internal successors, (386), 246 states have internal predecessors, (386), 49 states have call successors, (49), 16 states have call predecessors, (49), 19 states have return successors, (56), 48 states have call predecessors, (56), 48 states have call successors, (56) [2024-10-14 03:01:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 491 transitions. [2024-10-14 03:01:55,083 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 491 transitions. Word has length 91 [2024-10-14 03:01:55,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:01:55,083 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 491 transitions. [2024-10-14 03:01:55,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 03:01:55,083 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 491 transitions. [2024-10-14 03:01:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 03:01:55,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:01:55,084 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] [2024-10-14 03:01:55,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:01:55,085 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:01:55,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:01:55,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1960859148, now seen corresponding path program 1 times [2024-10-14 03:01:55,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:01:55,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201978913] [2024-10-14 03:01:55,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:01:55,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:01:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:55,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:01:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:55,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:01:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:55,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:01:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:55,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:01:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:55,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:01:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:55,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:01:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:55,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 03:01:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:55,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 03:01:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:55,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 03:01:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:55,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 03:01:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:55,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 03:01:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:55,275 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-14 03:01:55,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:01:55,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201978913] [2024-10-14 03:01:55,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201978913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:01:55,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:01:55,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:01:55,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724027448] [2024-10-14 03:01:55,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:01:55,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 03:01:55,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:01:55,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 03:01:55,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:01:55,277 INFO L87 Difference]: Start difference. First operand 311 states and 491 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-14 03:01:56,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:01:56,902 INFO L93 Difference]: Finished difference Result 677 states and 1082 transitions. [2024-10-14 03:01:56,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:01:56,902 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 92 [2024-10-14 03:01:56,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:01:56,904 INFO L225 Difference]: With dead ends: 677 [2024-10-14 03:01:56,905 INFO L226 Difference]: Without dead ends: 389 [2024-10-14 03:01:56,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 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-10-14 03:01:56,906 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 826 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 2980 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 3201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 2980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:01:56,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1343 Invalid, 3201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 2980 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 03:01:56,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-14 03:01:56,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 311. [2024-10-14 03:01:56,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 242 states have (on average 1.5950413223140496) internal successors, (386), 246 states have internal predecessors, (386), 49 states have call successors, (49), 16 states have call predecessors, (49), 19 states have return successors, (55), 48 states have call predecessors, (55), 48 states have call successors, (55) [2024-10-14 03:01:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 490 transitions. [2024-10-14 03:01:56,923 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 490 transitions. Word has length 92 [2024-10-14 03:01:56,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:01:56,924 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 490 transitions. [2024-10-14 03:01:56,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-14 03:01:56,924 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 490 transitions. [2024-10-14 03:01:56,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:01:56,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:01:56,925 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] [2024-10-14 03:01:56,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:01:56,926 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:01:56,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:01:56,926 INFO L85 PathProgramCache]: Analyzing trace with hash -532745963, now seen corresponding path program 2 times [2024-10-14 03:01:56,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:01:56,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388717715] [2024-10-14 03:01:56,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:01:56,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:01:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:57,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:01:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:57,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:01:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:57,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:01:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:57,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:01:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:57,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:01:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:57,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:01:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:57,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 03:01:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:57,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 03:01:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:57,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:01:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:57,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 03:01:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:57,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:01:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-14 03:01:57,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:01:57,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388717715] [2024-10-14 03:01:57,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388717715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:01:57,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:01:57,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:01:57,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408337268] [2024-10-14 03:01:57,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:01:57,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 03:01:57,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:01:57,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 03:01:57,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:01:57,091 INFO L87 Difference]: Start difference. First operand 311 states and 490 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-14 03:01:58,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:01:58,464 INFO L93 Difference]: Finished difference Result 679 states and 1088 transitions. [2024-10-14 03:01:58,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:01:58,465 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 93 [2024-10-14 03:01:58,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:01:58,470 INFO L225 Difference]: With dead ends: 679 [2024-10-14 03:01:58,470 INFO L226 Difference]: Without dead ends: 391 [2024-10-14 03:01:58,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 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-10-14 03:01:58,472 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 822 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 2999 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 3217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 2999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:01:58,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1343 Invalid, 3217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 2999 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 03:01:58,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-10-14 03:01:58,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 313. [2024-10-14 03:01:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 243 states have (on average 1.5925925925925926) internal successors, (387), 248 states have internal predecessors, (387), 49 states have call successors, (49), 16 states have call predecessors, (49), 20 states have return successors, (60), 48 states have call predecessors, (60), 48 states have call successors, (60) [2024-10-14 03:01:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 496 transitions. [2024-10-14 03:01:58,489 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 496 transitions. Word has length 93 [2024-10-14 03:01:58,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:01:58,489 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 496 transitions. [2024-10-14 03:01:58,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-14 03:01:58,490 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 496 transitions. [2024-10-14 03:01:58,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 03:01:58,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:01:58,491 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:01:58,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:01:58,491 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:01:58,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:01:58,491 INFO L85 PathProgramCache]: Analyzing trace with hash -439810963, now seen corresponding path program 1 times [2024-10-14 03:01:58,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:01:58,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643759286] [2024-10-14 03:01:58,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:01:58,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:01:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:58,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:01:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:58,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:01:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:58,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:01:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:58,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:01:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:58,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:01:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:58,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:01:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:58,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 03:01:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:58,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 03:01:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:58,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:01:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:58,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 03:01:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:58,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 03:01:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:58,618 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-14 03:01:58,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:01:58,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643759286] [2024-10-14 03:01:58,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643759286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:01:58,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:01:58,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 03:01:58,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156482560] [2024-10-14 03:01:58,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:01:58,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 03:01:58,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:01:58,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 03:01:58,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:01:58,620 INFO L87 Difference]: Start difference. First operand 313 states and 496 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 03:01:59,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:01:59,622 INFO L93 Difference]: Finished difference Result 681 states and 1091 transitions. [2024-10-14 03:01:59,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:01:59,623 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 94 [2024-10-14 03:01:59,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:01:59,625 INFO L225 Difference]: With dead ends: 681 [2024-10-14 03:01:59,625 INFO L226 Difference]: Without dead ends: 391 [2024-10-14 03:01:59,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:01:59,627 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 824 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 1781 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 1781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 03:01:59,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 960 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 1781 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 03:01:59,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-10-14 03:01:59,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 313. [2024-10-14 03:01:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 243 states have (on average 1.5925925925925926) internal successors, (387), 248 states have internal predecessors, (387), 49 states have call successors, (49), 16 states have call predecessors, (49), 20 states have return successors, (60), 48 states have call predecessors, (60), 48 states have call successors, (60) [2024-10-14 03:01:59,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 496 transitions. [2024-10-14 03:01:59,659 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 496 transitions. Word has length 94 [2024-10-14 03:01:59,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:01:59,659 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 496 transitions. [2024-10-14 03:01:59,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 03:01:59,659 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 496 transitions. [2024-10-14 03:01:59,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 03:01:59,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:01:59,661 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:01:59,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:01:59,662 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:01:59,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:01:59,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1315829969, now seen corresponding path program 1 times [2024-10-14 03:01:59,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:01:59,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929001068] [2024-10-14 03:01:59,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:01:59,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:01:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:59,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:01:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:59,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:01:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:59,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:01:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:59,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:01:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:59,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:01:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:59,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:01:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:59,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 03:01:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:59,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 03:01:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:59,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:01:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:59,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 03:01:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:59,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 03:01:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:01:59,819 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-14 03:01:59,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:01:59,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929001068] [2024-10-14 03:01:59,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929001068] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:01:59,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996486389] [2024-10-14 03:01:59,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:01:59,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:01:59,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:01:59,822 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:01:59,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 03:02:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:00,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 03:02:00,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:02:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:02:00,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:02:00,124 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:02:00,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996486389] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:02:00,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:02:00,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-10-14 03:02:00,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293506169] [2024-10-14 03:02:00,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:02:00,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 03:02:00,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:02:00,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 03:02:00,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:02:00,126 INFO L87 Difference]: Start difference. First operand 313 states and 496 transitions. Second operand has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 11 states have internal predecessors, (101), 4 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-14 03:02:01,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:02:01,750 INFO L93 Difference]: Finished difference Result 1008 states and 1698 transitions. [2024-10-14 03:02:01,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 03:02:01,750 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 11 states have internal predecessors, (101), 4 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 94 [2024-10-14 03:02:01,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:02:01,754 INFO L225 Difference]: With dead ends: 1008 [2024-10-14 03:02:01,754 INFO L226 Difference]: Without dead ends: 721 [2024-10-14 03:02:01,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2024-10-14 03:02:01,756 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1747 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 3384 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1764 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 3896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 3384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:02:01,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1764 Valid, 1526 Invalid, 3896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 3384 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 03:02:01,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2024-10-14 03:02:01,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 628. [2024-10-14 03:02:01,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 494 states have (on average 1.6295546558704452) internal successors, (805), 499 states have internal predecessors, (805), 113 states have call successors, (113), 16 states have call predecessors, (113), 20 states have return successors, (134), 112 states have call predecessors, (134), 112 states have call successors, (134) [2024-10-14 03:02:01,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1052 transitions. [2024-10-14 03:02:01,781 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 1052 transitions. Word has length 94 [2024-10-14 03:02:01,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:02:01,781 INFO L471 AbstractCegarLoop]: Abstraction has 628 states and 1052 transitions. [2024-10-14 03:02:01,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 11 states have internal predecessors, (101), 4 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-10-14 03:02:01,781 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 1052 transitions. [2024-10-14 03:02:01,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 03:02:01,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:02:01,783 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] [2024-10-14 03:02:01,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 03:02:01,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:02:01,984 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:02:01,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:02:01,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1144601497, now seen corresponding path program 1 times [2024-10-14 03:02:01,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:02:01,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027160030] [2024-10-14 03:02:01,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:02:01,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:02:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:02:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:02:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:02:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:02:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:02:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:02:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 03:02:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 03:02:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 03:02:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 03:02:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 03:02:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:02:02,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:02:02,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027160030] [2024-10-14 03:02:02,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027160030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:02:02,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:02:02,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:02:02,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694226462] [2024-10-14 03:02:02,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:02:02,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:02:02,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:02:02,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:02:02,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:02:02,078 INFO L87 Difference]: Start difference. First operand 628 states and 1052 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:02:02,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:02:02,826 INFO L93 Difference]: Finished difference Result 1563 states and 2687 transitions. [2024-10-14 03:02:02,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:02:02,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-14 03:02:02,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:02:02,832 INFO L225 Difference]: With dead ends: 1563 [2024-10-14 03:02:02,832 INFO L226 Difference]: Without dead ends: 1003 [2024-10-14 03:02:02,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:02:02,835 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 920 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:02:02,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 710 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:02:02,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2024-10-14 03:02:02,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 920. [2024-10-14 03:02:02,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 722 states have (on average 1.6371191135734071) internal successors, (1182), 727 states have internal predecessors, (1182), 177 states have call successors, (177), 16 states have call predecessors, (177), 20 states have return successors, (208), 176 states have call predecessors, (208), 176 states have call successors, (208) [2024-10-14 03:02:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1567 transitions. [2024-10-14 03:02:02,871 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1567 transitions. Word has length 98 [2024-10-14 03:02:02,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:02:02,871 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1567 transitions. [2024-10-14 03:02:02,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:02:02,871 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1567 transitions. [2024-10-14 03:02:02,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 03:02:02,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:02:02,874 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] [2024-10-14 03:02:02,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:02:02,874 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:02:02,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:02:02,875 INFO L85 PathProgramCache]: Analyzing trace with hash 720630119, now seen corresponding path program 1 times [2024-10-14 03:02:02,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:02:02,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933599131] [2024-10-14 03:02:02,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:02:02,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:02:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:02:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:02:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:02:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:02:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:02:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:02:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 03:02:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:02:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 03:02:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:02:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 03:02:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:02,971 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:02:02,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:02:02,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933599131] [2024-10-14 03:02:02,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933599131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:02:02,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:02:02,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:02:02,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215752750] [2024-10-14 03:02:02,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:02:02,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:02:02,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:02:02,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:02:02,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:02:02,973 INFO L87 Difference]: Start difference. First operand 920 states and 1567 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:02:03,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:02:03,787 INFO L93 Difference]: Finished difference Result 2280 states and 3944 transitions. [2024-10-14 03:02:03,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:02:03,788 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2024-10-14 03:02:03,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:02:03,794 INFO L225 Difference]: With dead ends: 2280 [2024-10-14 03:02:03,794 INFO L226 Difference]: Without dead ends: 1478 [2024-10-14 03:02:03,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:02:03,797 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 918 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:02:03,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 705 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:02:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2024-10-14 03:02:03,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1395. [2024-10-14 03:02:03,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1102 states have (on average 1.6388384754990926) internal successors, (1806), 1107 states have internal predecessors, (1806), 272 states have call successors, (272), 16 states have call predecessors, (272), 20 states have return successors, (303), 271 states have call predecessors, (303), 271 states have call successors, (303) [2024-10-14 03:02:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 2381 transitions. [2024-10-14 03:02:03,842 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 2381 transitions. Word has length 99 [2024-10-14 03:02:03,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:02:03,843 INFO L471 AbstractCegarLoop]: Abstraction has 1395 states and 2381 transitions. [2024-10-14 03:02:03,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:02:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 2381 transitions. [2024-10-14 03:02:03,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:02:03,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:02:03,847 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] [2024-10-14 03:02:03,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:02:03,847 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:02:03,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:02:03,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1582669223, now seen corresponding path program 1 times [2024-10-14 03:02:03,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:02:03,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433938054] [2024-10-14 03:02:03,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:02:03,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:02:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:03,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:02:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:03,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:02:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:03,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:02:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:03,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:02:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:03,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:02:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:03,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:02:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:03,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 03:02:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:03,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:02:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:03,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 03:02:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:03,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 03:02:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:03,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 03:02:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:03,928 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:02:03,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:02:03,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433938054] [2024-10-14 03:02:03,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433938054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:02:03,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:02:03,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:02:03,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201936290] [2024-10-14 03:02:03,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:02:03,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:02:03,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:02:03,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:02:03,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:02:03,930 INFO L87 Difference]: Start difference. First operand 1395 states and 2381 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:02:04,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:02:04,699 INFO L93 Difference]: Finished difference Result 3342 states and 5822 transitions. [2024-10-14 03:02:04,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:02:04,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2024-10-14 03:02:04,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:02:04,709 INFO L225 Difference]: With dead ends: 3342 [2024-10-14 03:02:04,709 INFO L226 Difference]: Without dead ends: 2193 [2024-10-14 03:02:04,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:02:04,713 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 916 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:02:04,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 701 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:02:04,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2024-10-14 03:02:04,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 2110. [2024-10-14 03:02:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2110 states, 1694 states have (on average 1.641086186540732) internal successors, (2780), 1699 states have internal predecessors, (2780), 395 states have call successors, (395), 16 states have call predecessors, (395), 20 states have return successors, (442), 394 states have call predecessors, (442), 394 states have call successors, (442) [2024-10-14 03:02:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 3617 transitions. [2024-10-14 03:02:04,799 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 3617 transitions. Word has length 100 [2024-10-14 03:02:04,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:02:04,800 INFO L471 AbstractCegarLoop]: Abstraction has 2110 states and 3617 transitions. [2024-10-14 03:02:04,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:02:04,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 3617 transitions. [2024-10-14 03:02:04,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 03:02:04,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:02:04,805 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] [2024-10-14 03:02:04,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:02:04,805 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:02:04,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:02:04,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1284537498, now seen corresponding path program 1 times [2024-10-14 03:02:04,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:02:04,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133660606] [2024-10-14 03:02:04,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:02:04,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:02:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:04,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:02:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:04,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:02:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:04,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:02:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:04,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:02:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:04,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:02:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:04,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:02:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:04,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 03:02:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:04,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 03:02:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:04,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 03:02:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:04,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:02:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:04,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:02:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:02:04,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:02:04,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133660606] [2024-10-14 03:02:04,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133660606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:02:04,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:02:04,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:02:04,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253077754] [2024-10-14 03:02:04,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:02:04,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:02:04,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:02:04,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:02:04,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:02:04,917 INFO L87 Difference]: Start difference. First operand 2110 states and 3617 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:02:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:02:05,733 INFO L93 Difference]: Finished difference Result 4984 states and 8735 transitions. [2024-10-14 03:02:05,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:02:05,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-10-14 03:02:05,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:02:05,747 INFO L225 Difference]: With dead ends: 4984 [2024-10-14 03:02:05,747 INFO L226 Difference]: Without dead ends: 3329 [2024-10-14 03:02:05,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:02:05,753 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 914 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:02:05,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 701 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:02:05,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2024-10-14 03:02:05,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3246. [2024-10-14 03:02:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3246 states, 2651 states have (on average 1.6423990946812523) internal successors, (4354), 2656 states have internal predecessors, (4354), 574 states have call successors, (574), 16 states have call predecessors, (574), 20 states have return successors, (647), 573 states have call predecessors, (647), 573 states have call successors, (647) [2024-10-14 03:02:05,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 5575 transitions. [2024-10-14 03:02:05,886 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 5575 transitions. Word has length 101 [2024-10-14 03:02:05,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:02:05,886 INFO L471 AbstractCegarLoop]: Abstraction has 3246 states and 5575 transitions. [2024-10-14 03:02:05,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:02:05,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 5575 transitions. [2024-10-14 03:02:05,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 03:02:05,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:02:05,891 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:02:05,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:02:05,892 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:02:05,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:02:05,892 INFO L85 PathProgramCache]: Analyzing trace with hash 133229149, now seen corresponding path program 1 times [2024-10-14 03:02:05,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:02:05,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468853030] [2024-10-14 03:02:05,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:02:05,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:02:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:05,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:02:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:05,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:02:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:05,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:02:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:05,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:02:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:05,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:02:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:05,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:02:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:05,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 03:02:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:05,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 03:02:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:05,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 03:02:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:05,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 03:02:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:05,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 03:02:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:02:05,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:02:05,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468853030] [2024-10-14 03:02:05,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468853030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:02:05,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:02:05,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:02:05,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165482010] [2024-10-14 03:02:05,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:02:05,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:02:05,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:02:05,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:02:05,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:02:05,978 INFO L87 Difference]: Start difference. First operand 3246 states and 5575 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:02:06,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:02:06,803 INFO L93 Difference]: Finished difference Result 7939 states and 13933 transitions. [2024-10-14 03:02:06,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:02:06,804 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2024-10-14 03:02:06,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:02:06,825 INFO L225 Difference]: With dead ends: 7939 [2024-10-14 03:02:06,825 INFO L226 Difference]: Without dead ends: 5387 [2024-10-14 03:02:06,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:02:06,832 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 912 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:02:06,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 736 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:02:06,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2024-10-14 03:02:07,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 5304. [2024-10-14 03:02:07,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5304 states, 4333 states have (on average 1.6332794830371566) internal successors, (7077), 4338 states have internal predecessors, (7077), 950 states have call successors, (950), 16 states have call predecessors, (950), 20 states have return successors, (1067), 949 states have call predecessors, (1067), 949 states have call successors, (1067) [2024-10-14 03:02:07,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5304 states to 5304 states and 9094 transitions. [2024-10-14 03:02:07,031 INFO L78 Accepts]: Start accepts. Automaton has 5304 states and 9094 transitions. Word has length 102 [2024-10-14 03:02:07,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:02:07,032 INFO L471 AbstractCegarLoop]: Abstraction has 5304 states and 9094 transitions. [2024-10-14 03:02:07,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:02:07,032 INFO L276 IsEmpty]: Start isEmpty. Operand 5304 states and 9094 transitions. [2024-10-14 03:02:07,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:02:07,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:02:07,040 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:02:07,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:02:07,041 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:02:07,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:02:07,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1990303586, now seen corresponding path program 1 times [2024-10-14 03:02:07,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:02:07,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792793078] [2024-10-14 03:02:07,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:02:07,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:02:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:07,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:02:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:07,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:02:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:07,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:02:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:07,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:02:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:07,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:02:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:07,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:02:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:07,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 03:02:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:07,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 03:02:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:07,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 03:02:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:07,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 03:02:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:07,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 03:02:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:07,122 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:02:07,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:02:07,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792793078] [2024-10-14 03:02:07,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792793078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:02:07,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:02:07,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:02:07,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659171926] [2024-10-14 03:02:07,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:02:07,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:02:07,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:02:07,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:02:07,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:02:07,125 INFO L87 Difference]: Start difference. First operand 5304 states and 9094 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:02:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:02:08,119 INFO L93 Difference]: Finished difference Result 13144 states and 23017 transitions. [2024-10-14 03:02:08,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:02:08,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-10-14 03:02:08,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:02:08,169 INFO L225 Difference]: With dead ends: 13144 [2024-10-14 03:02:08,173 INFO L226 Difference]: Without dead ends: 8920 [2024-10-14 03:02:08,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:02:08,188 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 910 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:02:08,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 711 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:02:08,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8920 states. [2024-10-14 03:02:08,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8920 to 8837. [2024-10-14 03:02:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8837 states, 7260 states have (on average 1.6300275482093665) internal successors, (11834), 7265 states have internal predecessors, (11834), 1556 states have call successors, (1556), 16 states have call predecessors, (1556), 20 states have return successors, (1751), 1555 states have call predecessors, (1751), 1555 states have call successors, (1751) [2024-10-14 03:02:08,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8837 states to 8837 states and 15141 transitions. [2024-10-14 03:02:08,552 INFO L78 Accepts]: Start accepts. Automaton has 8837 states and 15141 transitions. Word has length 103 [2024-10-14 03:02:08,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:02:08,552 INFO L471 AbstractCegarLoop]: Abstraction has 8837 states and 15141 transitions. [2024-10-14 03:02:08,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:02:08,553 INFO L276 IsEmpty]: Start isEmpty. Operand 8837 states and 15141 transitions. [2024-10-14 03:02:08,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 03:02:08,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:02:08,562 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:02:08,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:02:08,562 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:02:08,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:02:08,563 INFO L85 PathProgramCache]: Analyzing trace with hash -868526885, now seen corresponding path program 1 times [2024-10-14 03:02:08,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:02:08,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645750093] [2024-10-14 03:02:08,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:02:08,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:02:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:08,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:02:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:08,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:02:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:08,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:02:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:08,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:02:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:08,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:02:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:08,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:02:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:08,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 03:02:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:08,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 03:02:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:08,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 03:02:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:08,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 03:02:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:08,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 03:02:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:02:08,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:02:08,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645750093] [2024-10-14 03:02:08,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645750093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:02:08,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:02:08,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:02:08,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763535378] [2024-10-14 03:02:08,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:02:08,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:02:08,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:02:08,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:02:08,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:02:08,640 INFO L87 Difference]: Start difference. First operand 8837 states and 15141 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:02:09,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:02:09,650 INFO L93 Difference]: Finished difference Result 22916 states and 40046 transitions. [2024-10-14 03:02:09,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:02:09,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-10-14 03:02:09,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:02:09,700 INFO L225 Difference]: With dead ends: 22916 [2024-10-14 03:02:09,700 INFO L226 Difference]: Without dead ends: 15592 [2024-10-14 03:02:09,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:02:09,722 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 908 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:02:09,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 739 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:02:09,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15592 states. [2024-10-14 03:02:10,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15592 to 15509. [2024-10-14 03:02:10,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15509 states, 12729 states have (on average 1.6201586927488412) internal successors, (20623), 12734 states have internal predecessors, (20623), 2759 states have call successors, (2759), 16 states have call predecessors, (2759), 20 states have return successors, (3098), 2758 states have call predecessors, (3098), 2758 states have call successors, (3098) [2024-10-14 03:02:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15509 states to 15509 states and 26480 transitions. [2024-10-14 03:02:10,326 INFO L78 Accepts]: Start accepts. Automaton has 15509 states and 26480 transitions. Word has length 104 [2024-10-14 03:02:10,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:02:10,326 INFO L471 AbstractCegarLoop]: Abstraction has 15509 states and 26480 transitions. [2024-10-14 03:02:10,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:02:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand 15509 states and 26480 transitions. [2024-10-14 03:02:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 03:02:10,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:02:10,340 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:02:10,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 03:02:10,340 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:02:10,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:02:10,341 INFO L85 PathProgramCache]: Analyzing trace with hash 328956353, now seen corresponding path program 1 times [2024-10-14 03:02:10,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:02:10,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983544099] [2024-10-14 03:02:10,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:02:10,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:02:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:10,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:02:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:10,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:02:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:10,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:02:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:10,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:02:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:10,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:02:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:10,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:02:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:10,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:02:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:10,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 03:02:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:10,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:02:10,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:10,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 03:02:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:10,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 03:02:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:02:10,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:02:10,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983544099] [2024-10-14 03:02:10,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983544099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:02:10,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:02:10,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:02:10,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007785384] [2024-10-14 03:02:10,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:02:10,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:02:10,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:02:10,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:02:10,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:02:10,447 INFO L87 Difference]: Start difference. First operand 15509 states and 26480 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:02:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:02:11,798 INFO L93 Difference]: Finished difference Result 41083 states and 71644 transitions. [2024-10-14 03:02:11,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:02:11,799 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2024-10-14 03:02:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:02:11,878 INFO L225 Difference]: With dead ends: 41083 [2024-10-14 03:02:11,878 INFO L226 Difference]: Without dead ends: 27707 [2024-10-14 03:02:11,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:02:11,902 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 906 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:02:11,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 702 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:02:11,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27707 states. [2024-10-14 03:02:12,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27707 to 27624. [2024-10-14 03:02:12,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27624 states, 22805 states have (on average 1.615873711905284) internal successors, (36850), 22810 states have internal predecessors, (36850), 4798 states have call successors, (4798), 16 states have call predecessors, (4798), 20 states have return successors, (5411), 4797 states have call predecessors, (5411), 4797 states have call successors, (5411) [2024-10-14 03:02:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27624 states to 27624 states and 47059 transitions. [2024-10-14 03:02:12,845 INFO L78 Accepts]: Start accepts. Automaton has 27624 states and 47059 transitions. Word has length 105 [2024-10-14 03:02:12,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:02:12,846 INFO L471 AbstractCegarLoop]: Abstraction has 27624 states and 47059 transitions. [2024-10-14 03:02:12,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:02:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 27624 states and 47059 transitions. [2024-10-14 03:02:12,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-14 03:02:12,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:02:12,859 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:02:12,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 03:02:12,860 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:02:12,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:02:12,860 INFO L85 PathProgramCache]: Analyzing trace with hash 838376185, now seen corresponding path program 1 times [2024-10-14 03:02:12,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:02:12,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28358185] [2024-10-14 03:02:12,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:02:12,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:02:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:12,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:02:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:12,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:02:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:12,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:02:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:12,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:02:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:12,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:02:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:12,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:02:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:12,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 03:02:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:12,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 03:02:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:12,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 03:02:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:12,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 03:02:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:12,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 03:02:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:12,957 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:02:12,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:02:12,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28358185] [2024-10-14 03:02:12,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28358185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:02:12,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:02:12,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:02:12,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209610331] [2024-10-14 03:02:12,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:02:12,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:02:12,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:02:12,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:02:12,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:02:12,960 INFO L87 Difference]: Start difference. First operand 27624 states and 47059 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:02:14,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:02:14,977 INFO L93 Difference]: Finished difference Result 75275 states and 130438 transitions. [2024-10-14 03:02:14,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:02:14,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2024-10-14 03:02:14,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:02:15,168 INFO L225 Difference]: With dead ends: 75275 [2024-10-14 03:02:15,169 INFO L226 Difference]: Without dead ends: 50531 [2024-10-14 03:02:15,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:02:15,246 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 904 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:02:15,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 705 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:02:15,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50531 states. [2024-10-14 03:02:17,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50531 to 50448. [2024-10-14 03:02:17,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50448 states, 41914 states have (on average 1.6103927088800878) internal successors, (67498), 41919 states have internal predecessors, (67498), 8513 states have call successors, (8513), 16 states have call predecessors, (8513), 20 states have return successors, (9658), 8512 states have call predecessors, (9658), 8512 states have call successors, (9658) [2024-10-14 03:02:17,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50448 states to 50448 states and 85669 transitions. [2024-10-14 03:02:17,553 INFO L78 Accepts]: Start accepts. Automaton has 50448 states and 85669 transitions. Word has length 106 [2024-10-14 03:02:17,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:02:17,559 INFO L471 AbstractCegarLoop]: Abstraction has 50448 states and 85669 transitions. [2024-10-14 03:02:17,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:02:17,560 INFO L276 IsEmpty]: Start isEmpty. Operand 50448 states and 85669 transitions. [2024-10-14 03:02:17,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 03:02:17,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:02:17,595 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:02:17,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 03:02:17,595 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:02:17,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:02:17,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1424611743, now seen corresponding path program 1 times [2024-10-14 03:02:17,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:02:17,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369518672] [2024-10-14 03:02:17,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:02:17,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:02:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:17,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:02:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:17,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:02:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:17,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:02:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:17,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:02:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:17,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:02:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:17,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:02:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:17,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 03:02:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:17,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 03:02:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:17,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:02:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:17,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 03:02:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:17,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 03:02:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:17,674 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:02:17,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:02:17,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369518672] [2024-10-14 03:02:17,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369518672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:02:17,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:02:17,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:02:17,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016377823] [2024-10-14 03:02:17,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:02:17,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:02:17,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:02:17,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:02:17,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:02:17,676 INFO L87 Difference]: Start difference. First operand 50448 states and 85669 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:02:20,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:02:20,185 INFO L93 Difference]: Finished difference Result 94022 states and 163344 transitions. [2024-10-14 03:02:20,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:02:20,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2024-10-14 03:02:20,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:02:20,490 INFO L225 Difference]: With dead ends: 94022 [2024-10-14 03:02:20,491 INFO L226 Difference]: Without dead ends: 93911 [2024-10-14 03:02:20,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:02:20,529 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 899 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:02:20,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 711 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:02:20,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93911 states. [2024-10-14 03:02:23,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93911 to 93828. [2024-10-14 03:02:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93828 states, 78495 states have (on average 1.6034906681954264) internal successors, (125866), 78500 states have internal predecessors, (125866), 15312 states have call successors, (15312), 16 states have call predecessors, (15312), 20 states have return successors, (17503), 15311 states have call predecessors, (17503), 15311 states have call successors, (17503) [2024-10-14 03:02:23,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93828 states to 93828 states and 158681 transitions. [2024-10-14 03:02:23,890 INFO L78 Accepts]: Start accepts. Automaton has 93828 states and 158681 transitions. Word has length 107 [2024-10-14 03:02:23,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:02:23,890 INFO L471 AbstractCegarLoop]: Abstraction has 93828 states and 158681 transitions. [2024-10-14 03:02:23,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:02:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 93828 states and 158681 transitions. [2024-10-14 03:02:23,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 03:02:23,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:02:23,903 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:02:23,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 03:02:23,903 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:02:23,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:02:23,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1117930214, now seen corresponding path program 1 times [2024-10-14 03:02:23,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:02:23,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070194249] [2024-10-14 03:02:23,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:02:23,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:02:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:23,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 03:02:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:23,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 03:02:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:23,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:02:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:23,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:02:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:23,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 03:02:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:23,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:02:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:23,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 03:02:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:24,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 03:02:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:24,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 03:02:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:24,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 03:02:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:24,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 03:02:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:02:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 03:02:24,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:02:24,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070194249] [2024-10-14 03:02:24,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070194249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:02:24,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:02:24,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 03:02:24,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366951401] [2024-10-14 03:02:24,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:02:24,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 03:02:24,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:02:24,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 03:02:24,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:02:24,034 INFO L87 Difference]: Start difference. First operand 93828 states and 158681 transitions. Second operand has 9 states, 8 states have (on average 8.875) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 03:02:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:02:26,836 INFO L93 Difference]: Finished difference Result 93904 states and 162083 transitions. [2024-10-14 03:02:26,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:02:26,837 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-10-14 03:02:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:02:26,861 INFO L225 Difference]: With dead ends: 93904 [2024-10-14 03:02:26,862 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 03:02:27,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2024-10-14 03:02:27,011 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 813 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 03:02:27,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 968 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 03:02:27,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 03:02:27,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 03:02:27,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:02:27,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 03:02:27,035 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2024-10-14 03:02:27,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:02:27,035 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 03:02:27,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 03:02:27,036 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 03:02:27,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 03:02:27,038 INFO L782 garLoopResultBuilder]: Registering result SAFE for location outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 03:02:27,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 03:02:27,040 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:02:27,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.