./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_spec11_product37.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product37.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 70e213904f46d9e57b153e0058e447b0a5def856d61642628bc56ad0035cdccb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 21:50:44,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 21:50:44,527 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 21:50:44,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 21:50:44,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 21:50:44,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 21:50:44,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 21:50:44,558 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 21:50:44,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 21:50:44,558 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 21:50:44,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 21:50:44,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 21:50:44,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 21:50:44,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 21:50:44,559 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 21:50:44,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 21:50:44,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 21:50:44,560 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 21:50:44,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 21:50:44,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 21:50:44,561 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 21:50:44,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 21:50:44,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 21:50:44,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 21:50:44,567 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 21:50:44,567 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 21:50:44,568 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 21:50:44,568 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 21:50:44,568 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 21:50:44,568 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 21:50:44,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 21:50:44,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 21:50:44,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:50:44,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 21:50:44,569 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 21:50:44,569 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 21:50:44,569 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 21:50:44,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 21:50:44,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 21:50:44,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 21:50:44,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 21:50:44,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 21:50:44,570 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 -> 70e213904f46d9e57b153e0058e447b0a5def856d61642628bc56ad0035cdccb [2024-11-19 21:50:44,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 21:50:44,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 21:50:44,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 21:50:44,804 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 21:50:44,805 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 21:50:44,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product37.cil.c [2024-11-19 21:50:46,089 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 21:50:46,369 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 21:50:46,370 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product37.cil.c [2024-11-19 21:50:46,392 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda1915f7/bca4b83e676544568e93b2861d8f7c53/FLAG87703a349 [2024-11-19 21:50:46,403 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda1915f7/bca4b83e676544568e93b2861d8f7c53 [2024-11-19 21:50:46,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 21:50:46,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 21:50:46,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 21:50:46,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 21:50:46,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 21:50:46,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:50:46" (1/1) ... [2024-11-19 21:50:46,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6947276b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:50:46, skipping insertion in model container [2024-11-19 21:50:46,415 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:50:46" (1/1) ... [2024-11-19 21:50:46,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 21:50:46,893 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product37.cil.c[43755,43768] [2024-11-19 21:50:46,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:50:46,975 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 21:50:46,982 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2024-11-19 21:50:46,984 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [66] [2024-11-19 21:50:46,984 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [295] [2024-11-19 21:50:46,984 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [661] [2024-11-19 21:50:46,984 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1741] [2024-11-19 21:50:46,984 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptAutoResponder_spec.i","") [1790] [2024-11-19 21:50:46,984 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1812] [2024-11-19 21:50:46,984 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1821] [2024-11-19 21:50:46,985 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2233] [2024-11-19 21:50:46,985 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2524] [2024-11-19 21:50:46,985 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2753] [2024-11-19 21:50:47,031 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product37.cil.c[43755,43768] [2024-11-19 21:50:47,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:50:47,077 INFO L204 MainTranslator]: Completed translation [2024-11-19 21:50:47,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:50:47 WrapperNode [2024-11-19 21:50:47,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 21:50:47,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 21:50:47,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 21:50:47,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 21:50:47,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:50:47" (1/1) ... [2024-11-19 21:50:47,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:50:47" (1/1) ... [2024-11-19 21:50:47,139 INFO L138 Inliner]: procedures = 124, calls = 170, calls flagged for inlining = 51, calls inlined = 46, statements flattened = 837 [2024-11-19 21:50:47,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 21:50:47,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 21:50:47,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 21:50:47,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 21:50:47,149 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:50:47" (1/1) ... [2024-11-19 21:50:47,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:50:47" (1/1) ... [2024-11-19 21:50:47,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:50:47" (1/1) ... [2024-11-19 21:50:47,182 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-11-19 21:50:47,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:50:47" (1/1) ... [2024-11-19 21:50:47,182 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:50:47" (1/1) ... [2024-11-19 21:50:47,191 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:50:47" (1/1) ... [2024-11-19 21:50:47,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:50:47" (1/1) ... [2024-11-19 21:50:47,199 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:50:47" (1/1) ... [2024-11-19 21:50:47,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:50:47" (1/1) ... [2024-11-19 21:50:47,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 21:50:47,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 21:50:47,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 21:50:47,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 21:50:47,211 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:50:47" (1/1) ... [2024-11-19 21:50:47,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:50:47,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:50:47,268 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 21:50:47,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 21:50:47,309 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-19 21:50:47,310 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-19 21:50:47,310 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-19 21:50:47,310 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-19 21:50:47,310 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-19 21:50:47,310 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-19 21:50:47,310 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-19 21:50:47,311 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-19 21:50:47,311 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-19 21:50:47,311 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-19 21:50:47,311 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-19 21:50:47,312 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-19 21:50:47,312 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2024-11-19 21:50:47,312 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2024-11-19 21:50:47,312 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-19 21:50:47,312 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-19 21:50:47,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 21:50:47,313 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-19 21:50:47,313 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-19 21:50:47,314 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-19 21:50:47,314 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-19 21:50:47,314 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-19 21:50:47,314 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-19 21:50:47,314 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-19 21:50:47,314 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-19 21:50:47,314 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-19 21:50:47,314 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-19 21:50:47,314 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-19 21:50:47,315 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-19 21:50:47,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 21:50:47,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 21:50:47,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 21:50:47,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 21:50:47,315 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-19 21:50:47,315 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-19 21:50:47,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 21:50:47,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 21:50:47,484 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 21:50:47,486 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 21:50:48,014 INFO L? ?]: Removed 329 outVars from TransFormulas that were not future-live. [2024-11-19 21:50:48,014 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 21:50:48,033 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 21:50:48,034 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 21:50:48,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:50:48 BoogieIcfgContainer [2024-11-19 21:50:48,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 21:50:48,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 21:50:48,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 21:50:48,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 21:50:48,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:50:46" (1/3) ... [2024-11-19 21:50:48,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d10d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:50:48, skipping insertion in model container [2024-11-19 21:50:48,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:50:47" (2/3) ... [2024-11-19 21:50:48,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38d10d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:50:48, skipping insertion in model container [2024-11-19 21:50:48,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:50:48" (3/3) ... [2024-11-19 21:50:48,045 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec11_product37.cil.c [2024-11-19 21:50:48,062 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 21:50:48,062 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 21:50:48,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 21:50:48,142 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;@463dc33d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 21:50:48,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 21:50:48,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 258 states, 201 states have (on average 1.5223880597014925) internal successors, (306), 203 states have internal predecessors, (306), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-19 21:50:48,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-19 21:50:48,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:50:48,200 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:50:48,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:50:48,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:50:48,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1778421815, now seen corresponding path program 1 times [2024-11-19 21:50:48,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:50:48,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446686159] [2024-11-19 21:50:48,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:50:48,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:50:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:48,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:50:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:48,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:50:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:48,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:50:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:48,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:50:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:48,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:50:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:48,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:50:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:48,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 21:50:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:48,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-19 21:50:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:48,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:50:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:48,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 21:50:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:48,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:50:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 21:50:48,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:50:48,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446686159] [2024-11-19 21:50:48,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446686159] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:50:48,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817456195] [2024-11-19 21:50:48,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:50:48,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:50:48,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:50:48,827 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:50:48,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 21:50:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:49,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 21:50:49,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:50:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:50:49,085 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:50:49,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817456195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:50:49,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:50:49,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-19 21:50:49,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373205626] [2024-11-19 21:50:49,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:50:49,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 21:50:49,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:50:49,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 21:50:49,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:50:49,115 INFO L87 Difference]: Start difference. First operand has 258 states, 201 states have (on average 1.5223880597014925) internal successors, (306), 203 states have internal predecessors, (306), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 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-11-19 21:50:49,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:50:49,158 INFO L93 Difference]: Finished difference Result 357 states and 518 transitions. [2024-11-19 21:50:49,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 21:50:49,160 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 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-11-19 21:50:49,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:50:49,171 INFO L225 Difference]: With dead ends: 357 [2024-11-19 21:50:49,171 INFO L226 Difference]: Without dead ends: 251 [2024-11-19 21:50:49,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:50:49,176 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:50:49,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:50:49,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-19 21:50:49,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-11-19 21:50:49,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 195 states have (on average 1.5128205128205128) internal successors, (295), 196 states have internal predecessors, (295), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 21:50:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 374 transitions. [2024-11-19 21:50:49,229 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 374 transitions. Word has length 87 [2024-11-19 21:50:49,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:50:49,230 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 374 transitions. [2024-11-19 21:50:49,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 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-11-19 21:50:49,230 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 374 transitions. [2024-11-19 21:50:49,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-19 21:50:49,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:50:49,240 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:50:49,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 21:50:49,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 21:50:49,441 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:50:49,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:50:49,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1824099872, now seen corresponding path program 1 times [2024-11-19 21:50:49,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:50:49,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398249061] [2024-11-19 21:50:49,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:50:49,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:50:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:49,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:50:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:49,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:50:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:49,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:50:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:49,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:50:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:49,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:50:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:49,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:50:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:49,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-19 21:50:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:49,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:50:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:49,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 21:50:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:49,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-19 21:50:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:49,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:50:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:49,692 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 21:50:49,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:50:49,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398249061] [2024-11-19 21:50:49,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398249061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:50:49,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093763149] [2024-11-19 21:50:49,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:50:49,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:50:49,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:50:49,695 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:50:49,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 21:50:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:49,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 21:50:49,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:50:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:50:49,927 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:50:49,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093763149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:50:49,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:50:49,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-19 21:50:49,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668713983] [2024-11-19 21:50:49,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:50:49,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 21:50:49,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:50:49,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 21:50:49,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:50:49,931 INFO L87 Difference]: Start difference. First operand 251 states and 374 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-11-19 21:50:49,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:50:49,968 INFO L93 Difference]: Finished difference Result 347 states and 499 transitions. [2024-11-19 21:50:49,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 21:50:49,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 88 [2024-11-19 21:50:49,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:50:49,973 INFO L225 Difference]: With dead ends: 347 [2024-11-19 21:50:49,973 INFO L226 Difference]: Without dead ends: 254 [2024-11-19 21:50:49,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:50:49,975 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 1 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:50:49,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 742 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:50:49,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-19 21:50:49,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2024-11-19 21:50:49,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 197 states have (on average 1.5076142131979695) internal successors, (297), 198 states have internal predecessors, (297), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-19 21:50:49,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 376 transitions. [2024-11-19 21:50:49,994 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 376 transitions. Word has length 88 [2024-11-19 21:50:49,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:50:49,995 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 376 transitions. [2024-11-19 21:50:49,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-11-19 21:50:49,995 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 376 transitions. [2024-11-19 21:50:50,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 21:50:50,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:50:50,002 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:50:50,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 21:50:50,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-19 21:50:50,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:50:50,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:50:50,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2103248094, now seen corresponding path program 1 times [2024-11-19 21:50:50,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:50:50,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120480301] [2024-11-19 21:50:50,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:50:50,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:50:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:50,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:50:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:50,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:50:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:50,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:50:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:50,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:50:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:50,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:50:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:50,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:50:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:50,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-19 21:50:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:50,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-19 21:50:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:50,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:50:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:50,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:50:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:50,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 21:50:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:50,458 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 21:50:50,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:50:50,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120480301] [2024-11-19 21:50:50,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120480301] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:50:50,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025569328] [2024-11-19 21:50:50,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:50:50,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:50:50,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:50:50,461 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:50:50,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 21:50:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:50,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 21:50:50,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:50:50,690 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:50:50,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:50:50,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025569328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:50:50,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:50:50,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-19 21:50:50,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736681185] [2024-11-19 21:50:50,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:50:50,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 21:50:50,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:50:50,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 21:50:50,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:50:50,697 INFO L87 Difference]: Start difference. First operand 253 states and 376 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-11-19 21:50:50,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:50:50,736 INFO L93 Difference]: Finished difference Result 541 states and 819 transitions. [2024-11-19 21:50:50,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 21:50:50,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 97 [2024-11-19 21:50:50,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:50:50,740 INFO L225 Difference]: With dead ends: 541 [2024-11-19 21:50:50,741 INFO L226 Difference]: Without dead ends: 315 [2024-11-19 21:50:50,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 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-11-19 21:50:50,746 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 115 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:50:50,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 704 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:50:50,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-19 21:50:50,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 307. [2024-11-19 21:50:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 240 states have (on average 1.5291666666666666) internal successors, (367), 241 states have internal predecessors, (367), 51 states have call successors, (51), 15 states have call predecessors, (51), 15 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-19 21:50:50,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 468 transitions. [2024-11-19 21:50:50,768 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 468 transitions. Word has length 97 [2024-11-19 21:50:50,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:50:50,768 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 468 transitions. [2024-11-19 21:50:50,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-11-19 21:50:50,768 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 468 transitions. [2024-11-19 21:50:50,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 21:50:50,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:50:50,772 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:50:50,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 21:50:50,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:50:50,973 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:50:50,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:50:50,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1819301075, now seen corresponding path program 1 times [2024-11-19 21:50:50,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:50:50,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754615566] [2024-11-19 21:50:50,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:50:50,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:50:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:50:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:50:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:50:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:50:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:50:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:50:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-19 21:50:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:50:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:50:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:50:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 21:50:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 21:50:51,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:50:51,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754615566] [2024-11-19 21:50:51,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754615566] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:50:51,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500446937] [2024-11-19 21:50:51,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:50:51,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:50:51,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:50:51,145 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:50:51,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 21:50:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 21:50:51,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:50:51,390 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 21:50:51,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:50:51,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500446937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:50:51,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:50:51,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-19 21:50:51,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753300095] [2024-11-19 21:50:51,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:50:51,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:50:51,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:50:51,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:50:51,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:50:51,395 INFO L87 Difference]: Start difference. First operand 307 states and 468 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-11-19 21:50:51,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:50:51,447 INFO L93 Difference]: Finished difference Result 605 states and 926 transitions. [2024-11-19 21:50:51,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:50:51,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 98 [2024-11-19 21:50:51,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:50:51,450 INFO L225 Difference]: With dead ends: 605 [2024-11-19 21:50:51,450 INFO L226 Difference]: Without dead ends: 309 [2024-11-19 21:50:51,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:50:51,457 INFO L432 NwaCegarLoop]: 366 mSDtfsCounter, 2 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1453 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:50:51,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1453 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:50:51,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-19 21:50:51,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-11-19 21:50:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 241 states have (on average 1.5269709543568464) internal successors, (368), 243 states have internal predecessors, (368), 51 states have call successors, (51), 15 states have call predecessors, (51), 16 states have return successors, (52), 50 states have call predecessors, (52), 50 states have call successors, (52) [2024-11-19 21:50:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 471 transitions. [2024-11-19 21:50:51,486 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 471 transitions. Word has length 98 [2024-11-19 21:50:51,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:50:51,486 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 471 transitions. [2024-11-19 21:50:51,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-11-19 21:50:51,487 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 471 transitions. [2024-11-19 21:50:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 21:50:51,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:50:51,489 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:50:51,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 21:50:51,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:50:51,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:50:51,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:50:51,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1833333552, now seen corresponding path program 1 times [2024-11-19 21:50:51,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:50:51,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264840321] [2024-11-19 21:50:51,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:50:51,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:50:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:50:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:50:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:50:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:50:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:50:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:50:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-19 21:50:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 21:50:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 21:50:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:50:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-19 21:50:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:50:51,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:50:51,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264840321] [2024-11-19 21:50:51,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264840321] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:50:51,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322573315] [2024-11-19 21:50:51,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:50:51,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:50:51,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:50:51,877 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:50:51,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 21:50:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:52,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 21:50:52,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:50:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 21:50:52,146 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:50:52,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322573315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:50:52,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:50:52,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-19 21:50:52,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577074322] [2024-11-19 21:50:52,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:50:52,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:50:52,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:50:52,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:50:52,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-19 21:50:52,150 INFO L87 Difference]: Start difference. First operand 309 states and 471 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-11-19 21:50:52,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:50:52,225 INFO L93 Difference]: Finished difference Result 607 states and 931 transitions. [2024-11-19 21:50:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:50:52,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 99 [2024-11-19 21:50:52,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:50:52,228 INFO L225 Difference]: With dead ends: 607 [2024-11-19 21:50:52,229 INFO L226 Difference]: Without dead ends: 311 [2024-11-19 21:50:52,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-19 21:50:52,231 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 2 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:50:52,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1439 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:50:52,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-19 21:50:52,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-11-19 21:50:52,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 242 states have (on average 1.524793388429752) internal successors, (369), 245 states have internal predecessors, (369), 51 states have call successors, (51), 15 states have call predecessors, (51), 17 states have return successors, (57), 50 states have call predecessors, (57), 50 states have call successors, (57) [2024-11-19 21:50:52,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 477 transitions. [2024-11-19 21:50:52,250 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 477 transitions. Word has length 99 [2024-11-19 21:50:52,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:50:52,250 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 477 transitions. [2024-11-19 21:50:52,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-11-19 21:50:52,252 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 477 transitions. [2024-11-19 21:50:52,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 21:50:52,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:50:52,254 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:50:52,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 21:50:52,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:50:52,454 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:50:52,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:50:52,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1735515559, now seen corresponding path program 1 times [2024-11-19 21:50:52,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:50:52,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314033276] [2024-11-19 21:50:52,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:50:52,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:50:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:52,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:50:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:52,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:50:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:52,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:50:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:52,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:50:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:52,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:50:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:52,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-19 21:50:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:52,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-19 21:50:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:52,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-19 21:50:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:52,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 21:50:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:52,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:50:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:52,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:50:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:52,613 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 21:50:52,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:50:52,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314033276] [2024-11-19 21:50:52,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314033276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:50:52,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:50:52,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:50:52,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399108841] [2024-11-19 21:50:52,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:50:52,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:50:52,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:50:52,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:50:52,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:50:52,614 INFO L87 Difference]: Start difference. First operand 311 states and 477 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 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-11-19 21:50:53,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:50:53,895 INFO L93 Difference]: Finished difference Result 722 states and 1120 transitions. [2024-11-19 21:50:53,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 21:50:53,895 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 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 100 [2024-11-19 21:50:53,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:50:53,898 INFO L225 Difference]: With dead ends: 722 [2024-11-19 21:50:53,898 INFO L226 Difference]: Without dead ends: 434 [2024-11-19 21:50:53,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-19 21:50:53,902 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 682 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 1772 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:50:53,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 1172 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1772 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 21:50:53,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-19 21:50:53,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 311. [2024-11-19 21:50:53,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 242 states have (on average 1.524793388429752) internal successors, (369), 245 states have internal predecessors, (369), 51 states have call successors, (51), 15 states have call predecessors, (51), 17 states have return successors, (56), 50 states have call predecessors, (56), 50 states have call successors, (56) [2024-11-19 21:50:53,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 476 transitions. [2024-11-19 21:50:53,933 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 476 transitions. Word has length 100 [2024-11-19 21:50:53,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:50:53,933 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 476 transitions. [2024-11-19 21:50:53,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 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-11-19 21:50:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 476 transitions. [2024-11-19 21:50:53,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-19 21:50:53,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:50:53,936 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:50:53,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 21:50:53,936 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:50:53,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:50:53,937 INFO L85 PathProgramCache]: Analyzing trace with hash 2005228972, now seen corresponding path program 2 times [2024-11-19 21:50:53,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:50:53,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948590989] [2024-11-19 21:50:53,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:50:53,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:50:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:54,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:50:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:54,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:50:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:54,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:50:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:54,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:50:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:54,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:50:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:54,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:50:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:54,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-19 21:50:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:54,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-19 21:50:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:54,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:50:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:54,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-19 21:50:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:54,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-19 21:50:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:54,104 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 21:50:54,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:50:54,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948590989] [2024-11-19 21:50:54,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948590989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:50:54,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:50:54,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:50:54,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904127521] [2024-11-19 21:50:54,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:50:54,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:50:54,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:50:54,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:50:54,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:50:54,107 INFO L87 Difference]: Start difference. First operand 311 states and 476 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 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-11-19 21:50:55,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:50:55,323 INFO L93 Difference]: Finished difference Result 724 states and 1123 transitions. [2024-11-19 21:50:55,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 21:50:55,324 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 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 101 [2024-11-19 21:50:55,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:50:55,327 INFO L225 Difference]: With dead ends: 724 [2024-11-19 21:50:55,327 INFO L226 Difference]: Without dead ends: 436 [2024-11-19 21:50:55,328 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-11-19 21:50:55,328 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 678 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 1790 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 2027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:50:55,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 1172 Invalid, 2027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1790 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 21:50:55,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-19 21:50:55,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 313. [2024-11-19 21:50:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 243 states have (on average 1.522633744855967) internal successors, (370), 247 states have internal predecessors, (370), 51 states have call successors, (51), 15 states have call predecessors, (51), 18 states have return successors, (58), 50 states have call predecessors, (58), 50 states have call successors, (58) [2024-11-19 21:50:55,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 479 transitions. [2024-11-19 21:50:55,356 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 479 transitions. Word has length 101 [2024-11-19 21:50:55,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:50:55,356 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 479 transitions. [2024-11-19 21:50:55,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 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-11-19 21:50:55,356 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 479 transitions. [2024-11-19 21:50:55,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 21:50:55,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:50:55,357 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:50:55,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 21:50:55,358 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:50:55,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:50:55,358 INFO L85 PathProgramCache]: Analyzing trace with hash 2093975266, now seen corresponding path program 1 times [2024-11-19 21:50:55,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:50:55,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323309160] [2024-11-19 21:50:55,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:50:55,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:50:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:55,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:50:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:55,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:50:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:55,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:50:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:55,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:50:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:55,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:50:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:55,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:50:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:55,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-19 21:50:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:55,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-19 21:50:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:55,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-19 21:50:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:55,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-19 21:50:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:55,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:50:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:50:55,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:50:55,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323309160] [2024-11-19 21:50:55,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323309160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:50:55,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:50:55,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 21:50:55,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357312113] [2024-11-19 21:50:55,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:50:55,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:50:55,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:50:55,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:50:55,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:50:55,543 INFO L87 Difference]: Start difference. First operand 313 states and 479 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 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-11-19 21:50:57,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:50:57,128 INFO L93 Difference]: Finished difference Result 722 states and 1118 transitions. [2024-11-19 21:50:57,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 21:50:57,129 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 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 102 [2024-11-19 21:50:57,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:50:57,131 INFO L225 Difference]: With dead ends: 722 [2024-11-19 21:50:57,131 INFO L226 Difference]: Without dead ends: 436 [2024-11-19 21:50:57,132 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-11-19 21:50:57,132 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 683 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 2893 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 3138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 2893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:50:57,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1622 Invalid, 3138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 2893 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 21:50:57,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-19 21:50:57,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 313. [2024-11-19 21:50:57,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 243 states have (on average 1.522633744855967) internal successors, (370), 247 states have internal predecessors, (370), 51 states have call successors, (51), 15 states have call predecessors, (51), 18 states have return successors, (57), 50 states have call predecessors, (57), 50 states have call successors, (57) [2024-11-19 21:50:57,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 478 transitions. [2024-11-19 21:50:57,151 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 478 transitions. Word has length 102 [2024-11-19 21:50:57,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:50:57,152 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 478 transitions. [2024-11-19 21:50:57,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 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-11-19 21:50:57,152 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 478 transitions. [2024-11-19 21:50:57,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 21:50:57,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:50:57,153 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:50:57,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 21:50:57,154 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:50:57,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:50:57,154 INFO L85 PathProgramCache]: Analyzing trace with hash 796053935, now seen corresponding path program 2 times [2024-11-19 21:50:57,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:50:57,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899654645] [2024-11-19 21:50:57,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:50:57,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:50:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:57,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:50:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:57,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:50:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:57,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:50:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:57,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:50:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:57,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:50:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:57,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:50:57,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:57,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:50:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:57,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-19 21:50:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:57,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:50:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:57,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-19 21:50:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:57,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:50:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:50:57,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:50:57,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899654645] [2024-11-19 21:50:57,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899654645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:50:57,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:50:57,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 21:50:57,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132571283] [2024-11-19 21:50:57,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:50:57,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:50:57,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:50:57,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:50:57,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:50:57,334 INFO L87 Difference]: Start difference. First operand 313 states and 478 transitions. Second operand has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 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-11-19 21:50:58,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:50:58,943 INFO L93 Difference]: Finished difference Result 724 states and 1124 transitions. [2024-11-19 21:50:58,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 21:50:58,944 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 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 103 [2024-11-19 21:50:58,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:50:58,946 INFO L225 Difference]: With dead ends: 724 [2024-11-19 21:50:58,946 INFO L226 Difference]: Without dead ends: 438 [2024-11-19 21:50:58,947 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-11-19 21:50:58,947 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 679 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 2930 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 3172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 2930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:50:58,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1623 Invalid, 3172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 2930 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 21:50:58,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-19 21:50:58,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 315. [2024-11-19 21:50:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 244 states have (on average 1.5204918032786885) internal successors, (371), 249 states have internal predecessors, (371), 51 states have call successors, (51), 15 states have call predecessors, (51), 19 states have return successors, (62), 50 states have call predecessors, (62), 50 states have call successors, (62) [2024-11-19 21:50:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 484 transitions. [2024-11-19 21:50:58,963 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 484 transitions. Word has length 103 [2024-11-19 21:50:58,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:50:58,964 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 484 transitions. [2024-11-19 21:50:58,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 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-11-19 21:50:58,964 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 484 transitions. [2024-11-19 21:50:58,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 21:50:58,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:50:58,965 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:50:58,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 21:50:58,965 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:50:58,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:50:58,965 INFO L85 PathProgramCache]: Analyzing trace with hash -280241827, now seen corresponding path program 1 times [2024-11-19 21:50:58,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:50:58,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023609582] [2024-11-19 21:50:58,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:50:58,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:50:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:59,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:50:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:59,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:50:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:59,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:50:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:59,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:50:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:59,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:50:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:59,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:50:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:59,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 21:50:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:59,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 21:50:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:59,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:50:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:59,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-19 21:50:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:59,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:50:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:59,164 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 21:50:59,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:50:59,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023609582] [2024-11-19 21:50:59,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023609582] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:50:59,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438918607] [2024-11-19 21:50:59,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:50:59,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:50:59,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:50:59,167 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:50:59,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 21:50:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:50:59,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 21:50:59,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:50:59,408 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:50:59,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:50:59,481 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:50:59,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438918607] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:50:59,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:50:59,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-11-19 21:50:59,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468904173] [2024-11-19 21:50:59,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:50:59,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 21:50:59,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:50:59,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 21:50:59,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-19 21:50:59,485 INFO L87 Difference]: Start difference. First operand 315 states and 484 transitions. Second operand has 15 states, 14 states have (on average 8.357142857142858) internal successors, (117), 11 states have internal predecessors, (117), 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-11-19 21:51:01,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:51:01,294 INFO L93 Difference]: Finished difference Result 1099 states and 1796 transitions. [2024-11-19 21:51:01,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 21:51:01,302 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 8.357142857142858) internal successors, (117), 11 states have internal predecessors, (117), 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 104 [2024-11-19 21:51:01,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:51:01,307 INFO L225 Difference]: With dead ends: 1099 [2024-11-19 21:51:01,308 INFO L226 Difference]: Without dead ends: 815 [2024-11-19 21:51:01,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 225 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-11-19 21:51:01,310 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 1767 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 3367 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1784 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 3915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 3367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 21:51:01,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1784 Valid, 1805 Invalid, 3915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 3367 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 21:51:01,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2024-11-19 21:51:01,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 668. [2024-11-19 21:51:01,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 533 states have (on average 1.5797373358348967) internal successors, (842), 538 states have internal predecessors, (842), 115 states have call successors, (115), 15 states have call predecessors, (115), 19 states have return successors, (136), 114 states have call predecessors, (136), 114 states have call successors, (136) [2024-11-19 21:51:01,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 1093 transitions. [2024-11-19 21:51:01,345 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 1093 transitions. Word has length 104 [2024-11-19 21:51:01,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:51:01,345 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 1093 transitions. [2024-11-19 21:51:01,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 8.357142857142858) internal successors, (117), 11 states have internal predecessors, (117), 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-11-19 21:51:01,345 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 1093 transitions. [2024-11-19 21:51:01,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 21:51:01,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:51:01,348 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-11-19 21:51:01,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 21:51:01,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:51:01,553 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:51:01,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:51:01,553 INFO L85 PathProgramCache]: Analyzing trace with hash 110933035, now seen corresponding path program 1 times [2024-11-19 21:51:01,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:51:01,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396476318] [2024-11-19 21:51:01,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:01,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:51:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:01,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:51:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:01,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:51:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:01,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:51:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:01,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:51:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:01,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:51:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:01,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:51:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:01,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-19 21:51:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:01,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:51:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:01,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-19 21:51:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:01,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-19 21:51:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:01,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-19 21:51:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:01,640 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:51:01,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:51:01,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396476318] [2024-11-19 21:51:01,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396476318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:51:01,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:51:01,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:51:01,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007161681] [2024-11-19 21:51:01,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:51:01,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:51:01,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:51:01,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:51:01,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:51:01,641 INFO L87 Difference]: Start difference. First operand 668 states and 1093 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-11-19 21:51:02,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:51:02,507 INFO L93 Difference]: Finished difference Result 1714 states and 2875 transitions. [2024-11-19 21:51:02,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:51:02,508 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-11-19 21:51:02,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:51:02,513 INFO L225 Difference]: With dead ends: 1714 [2024-11-19 21:51:02,513 INFO L226 Difference]: Without dead ends: 1124 [2024-11-19 21:51:02,514 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-11-19 21:51:02,515 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 790 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:51:02,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 874 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 21:51:02,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2024-11-19 21:51:02,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 993. [2024-11-19 21:51:02,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 794 states have (on average 1.5957178841309825) internal successors, (1267), 799 states have internal predecessors, (1267), 179 states have call successors, (179), 15 states have call predecessors, (179), 19 states have return successors, (210), 178 states have call predecessors, (210), 178 states have call successors, (210) [2024-11-19 21:51:02,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1656 transitions. [2024-11-19 21:51:02,550 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1656 transitions. Word has length 107 [2024-11-19 21:51:02,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:51:02,550 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 1656 transitions. [2024-11-19 21:51:02,550 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-11-19 21:51:02,550 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1656 transitions. [2024-11-19 21:51:02,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 21:51:02,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:51:02,553 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-11-19 21:51:02,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 21:51:02,554 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:51:02,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:51:02,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1931200409, now seen corresponding path program 1 times [2024-11-19 21:51:02,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:51:02,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840669349] [2024-11-19 21:51:02,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:02,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:51:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:02,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:51:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:02,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:51:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:02,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:51:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:02,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:51:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:02,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:51:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:02,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:51:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:02,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-19 21:51:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:02,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:51:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:02,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-19 21:51:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:02,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 21:51:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:02,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:51:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:51:02,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:51:02,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840669349] [2024-11-19 21:51:02,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840669349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:51:02,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:51:02,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:51:02,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539662653] [2024-11-19 21:51:02,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:51:02,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:51:02,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:51:02,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:51:02,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:51:02,635 INFO L87 Difference]: Start difference. First operand 993 states and 1656 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:51:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:51:03,451 INFO L93 Difference]: Finished difference Result 2519 states and 4259 transitions. [2024-11-19 21:51:03,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:51:03,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-11-19 21:51:03,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:51:03,459 INFO L225 Difference]: With dead ends: 2519 [2024-11-19 21:51:03,459 INFO L226 Difference]: Without dead ends: 1657 [2024-11-19 21:51:03,462 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-11-19 21:51:03,463 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 788 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:51:03,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 860 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 21:51:03,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2024-11-19 21:51:03,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1526. [2024-11-19 21:51:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1232 states have (on average 1.6014610389610389) internal successors, (1973), 1237 states have internal predecessors, (1973), 274 states have call successors, (274), 15 states have call predecessors, (274), 19 states have return successors, (305), 273 states have call predecessors, (305), 273 states have call successors, (305) [2024-11-19 21:51:03,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 2552 transitions. [2024-11-19 21:51:03,531 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 2552 transitions. Word has length 108 [2024-11-19 21:51:03,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:51:03,532 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 2552 transitions. [2024-11-19 21:51:03,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:51:03,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 2552 transitions. [2024-11-19 21:51:03,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 21:51:03,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:51:03,536 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:51:03,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 21:51:03,536 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:51:03,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:51:03,537 INFO L85 PathProgramCache]: Analyzing trace with hash -997062983, now seen corresponding path program 1 times [2024-11-19 21:51:03,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:51:03,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516534342] [2024-11-19 21:51:03,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:03,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:51:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:03,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:51:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:03,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:51:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:03,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:51:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:03,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:51:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:03,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:51:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:03,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:51:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:03,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 21:51:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:03,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:51:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:03,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-19 21:51:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:03,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 21:51:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:03,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-19 21:51:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:03,625 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:51:03,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:51:03,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516534342] [2024-11-19 21:51:03,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516534342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:51:03,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:51:03,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:51:03,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106042052] [2024-11-19 21:51:03,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:51:03,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:51:03,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:51:03,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:51:03,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:51:03,626 INFO L87 Difference]: Start difference. First operand 1526 states and 2552 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:51:04,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:51:04,431 INFO L93 Difference]: Finished difference Result 3726 states and 6345 transitions. [2024-11-19 21:51:04,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:51:04,431 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2024-11-19 21:51:04,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:51:04,441 INFO L225 Difference]: With dead ends: 3726 [2024-11-19 21:51:04,441 INFO L226 Difference]: Without dead ends: 2466 [2024-11-19 21:51:04,444 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-11-19 21:51:04,446 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 786 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:51:04,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 852 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 21:51:04,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2466 states. [2024-11-19 21:51:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2466 to 2335. [2024-11-19 21:51:04,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 1918 states have (on average 1.6058394160583942) internal successors, (3080), 1923 states have internal predecessors, (3080), 397 states have call successors, (397), 15 states have call predecessors, (397), 19 states have return successors, (444), 396 states have call predecessors, (444), 396 states have call successors, (444) [2024-11-19 21:51:04,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3921 transitions. [2024-11-19 21:51:04,523 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3921 transitions. Word has length 109 [2024-11-19 21:51:04,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:51:04,523 INFO L471 AbstractCegarLoop]: Abstraction has 2335 states and 3921 transitions. [2024-11-19 21:51:04,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:51:04,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3921 transitions. [2024-11-19 21:51:04,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 21:51:04,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:51:04,528 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:51:04,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 21:51:04,528 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:51:04,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:51:04,529 INFO L85 PathProgramCache]: Analyzing trace with hash 699673466, now seen corresponding path program 1 times [2024-11-19 21:51:04,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:51:04,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608778328] [2024-11-19 21:51:04,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:04,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:51:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:04,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:51:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:04,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:51:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:04,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:51:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:04,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:51:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:04,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:51:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:04,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:51:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:04,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-19 21:51:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:04,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 21:51:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:04,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-19 21:51:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:04,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-19 21:51:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:04,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:51:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:04,602 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:51:04,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:51:04,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608778328] [2024-11-19 21:51:04,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608778328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:51:04,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:51:04,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:51:04,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470423628] [2024-11-19 21:51:04,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:51:04,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:51:04,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:51:04,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:51:04,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:51:04,604 INFO L87 Difference]: Start difference. First operand 2335 states and 3921 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:51:05,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:51:05,480 INFO L93 Difference]: Finished difference Result 5610 states and 9605 transitions. [2024-11-19 21:51:05,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:51:05,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2024-11-19 21:51:05,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:51:05,496 INFO L225 Difference]: With dead ends: 5610 [2024-11-19 21:51:05,496 INFO L226 Difference]: Without dead ends: 3760 [2024-11-19 21:51:05,502 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-11-19 21:51:05,502 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 783 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:51:05,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 853 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 21:51:05,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3760 states. [2024-11-19 21:51:05,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3760 to 3629. [2024-11-19 21:51:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3629 states, 3033 states have (on average 1.6083086053412463) internal successors, (4878), 3038 states have internal predecessors, (4878), 576 states have call successors, (576), 15 states have call predecessors, (576), 19 states have return successors, (649), 575 states have call predecessors, (649), 575 states have call successors, (649) [2024-11-19 21:51:05,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3629 states to 3629 states and 6103 transitions. [2024-11-19 21:51:05,645 INFO L78 Accepts]: Start accepts. Automaton has 3629 states and 6103 transitions. Word has length 110 [2024-11-19 21:51:05,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:51:05,646 INFO L471 AbstractCegarLoop]: Abstraction has 3629 states and 6103 transitions. [2024-11-19 21:51:05,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:51:05,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3629 states and 6103 transitions. [2024-11-19 21:51:05,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 21:51:05,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:51:05,652 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:51:05,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 21:51:05,652 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:51:05,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:51:05,652 INFO L85 PathProgramCache]: Analyzing trace with hash -293605899, now seen corresponding path program 1 times [2024-11-19 21:51:05,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:51:05,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607319142] [2024-11-19 21:51:05,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:05,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:51:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:05,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:51:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:05,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:51:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:05,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:51:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:05,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:51:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:05,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:51:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:05,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:51:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:05,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 21:51:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:05,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 21:51:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:05,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:51:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:05,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:51:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:05,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-19 21:51:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:05,737 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:51:05,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:51:05,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607319142] [2024-11-19 21:51:05,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607319142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:51:05,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:51:05,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:51:05,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550814275] [2024-11-19 21:51:05,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:51:05,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:51:05,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:51:05,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:51:05,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:51:05,738 INFO L87 Difference]: Start difference. First operand 3629 states and 6103 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:51:06,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:51:06,653 INFO L93 Difference]: Finished difference Result 8713 states and 14969 transitions. [2024-11-19 21:51:06,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:51:06,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2024-11-19 21:51:06,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:51:06,682 INFO L225 Difference]: With dead ends: 8713 [2024-11-19 21:51:06,682 INFO L226 Difference]: Without dead ends: 5901 [2024-11-19 21:51:06,690 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-11-19 21:51:06,691 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 784 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:51:06,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 886 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 21:51:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5901 states. [2024-11-19 21:51:06,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5901 to 5770. [2024-11-19 21:51:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5770 states, 4798 states have (on average 1.6015006252605253) internal successors, (7684), 4803 states have internal predecessors, (7684), 952 states have call successors, (952), 15 states have call predecessors, (952), 19 states have return successors, (1069), 951 states have call predecessors, (1069), 951 states have call successors, (1069) [2024-11-19 21:51:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5770 states to 5770 states and 9705 transitions. [2024-11-19 21:51:06,905 INFO L78 Accepts]: Start accepts. Automaton has 5770 states and 9705 transitions. Word has length 111 [2024-11-19 21:51:06,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:51:06,905 INFO L471 AbstractCegarLoop]: Abstraction has 5770 states and 9705 transitions. [2024-11-19 21:51:06,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:51:06,905 INFO L276 IsEmpty]: Start isEmpty. Operand 5770 states and 9705 transitions. [2024-11-19 21:51:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 21:51:06,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:51:06,913 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:51:06,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 21:51:06,913 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:51:06,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:51:06,913 INFO L85 PathProgramCache]: Analyzing trace with hash 298768446, now seen corresponding path program 1 times [2024-11-19 21:51:06,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:51:06,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144280829] [2024-11-19 21:51:06,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:06,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:51:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:06,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:51:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:06,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:51:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:06,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:51:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:06,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:51:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:06,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:51:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:06,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:51:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:06,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:51:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:06,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:51:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:06,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:51:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:06,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-19 21:51:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:06,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 21:51:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:51:06,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:51:06,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144280829] [2024-11-19 21:51:06,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144280829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:51:06,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:51:06,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:51:06,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132492017] [2024-11-19 21:51:06,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:51:06,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:51:06,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:51:06,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:51:06,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:51:06,992 INFO L87 Difference]: Start difference. First operand 5770 states and 9705 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (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-11-19 21:51:08,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:51:08,059 INFO L93 Difference]: Finished difference Result 14330 states and 24582 transitions. [2024-11-19 21:51:08,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:51:08,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (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 112 [2024-11-19 21:51:08,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:51:08,102 INFO L225 Difference]: With dead ends: 14330 [2024-11-19 21:51:08,103 INFO L226 Difference]: Without dead ends: 9779 [2024-11-19 21:51:08,116 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-11-19 21:51:08,116 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 780 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:51:08,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 860 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 21:51:08,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9779 states. [2024-11-19 21:51:08,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9779 to 9648. [2024-11-19 21:51:08,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9648 states, 8070 states have (on average 1.5988847583643122) internal successors, (12903), 8075 states have internal predecessors, (12903), 1558 states have call successors, (1558), 15 states have call predecessors, (1558), 19 states have return successors, (1753), 1557 states have call predecessors, (1753), 1557 states have call successors, (1753) [2024-11-19 21:51:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9648 states to 9648 states and 16214 transitions. [2024-11-19 21:51:08,458 INFO L78 Accepts]: Start accepts. Automaton has 9648 states and 16214 transitions. Word has length 112 [2024-11-19 21:51:08,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:51:08,459 INFO L471 AbstractCegarLoop]: Abstraction has 9648 states and 16214 transitions. [2024-11-19 21:51:08,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (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-11-19 21:51:08,459 INFO L276 IsEmpty]: Start isEmpty. Operand 9648 states and 16214 transitions. [2024-11-19 21:51:08,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 21:51:08,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:51:08,469 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:51:08,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 21:51:08,469 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:51:08,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:51:08,469 INFO L85 PathProgramCache]: Analyzing trace with hash 374256355, now seen corresponding path program 1 times [2024-11-19 21:51:08,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:51:08,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506847655] [2024-11-19 21:51:08,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:08,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:51:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:08,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:51:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:08,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:51:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:08,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:51:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:08,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:51:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:08,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:51:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:08,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:51:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:08,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:51:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:08,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-19 21:51:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:08,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-19 21:51:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:08,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:51:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:08,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-19 21:51:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:08,569 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:51:08,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:51:08,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506847655] [2024-11-19 21:51:08,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506847655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:51:08,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:51:08,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:51:08,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243590448] [2024-11-19 21:51:08,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:51:08,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:51:08,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:51:08,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:51:08,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:51:08,570 INFO L87 Difference]: Start difference. First operand 9648 states and 16214 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (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-11-19 21:51:09,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:51:09,665 INFO L93 Difference]: Finished difference Result 25039 states and 42863 transitions. [2024-11-19 21:51:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:51:09,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (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 113 [2024-11-19 21:51:09,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:51:09,712 INFO L225 Difference]: With dead ends: 25039 [2024-11-19 21:51:09,712 INFO L226 Difference]: Without dead ends: 17092 [2024-11-19 21:51:09,734 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-11-19 21:51:09,734 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 778 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:51:09,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 866 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 21:51:09,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17092 states. [2024-11-19 21:51:10,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17092 to 16961. [2024-11-19 21:51:10,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16961 states, 14180 states have (on average 1.5901974612129761) internal successors, (22549), 14185 states have internal predecessors, (22549), 2761 states have call successors, (2761), 15 states have call predecessors, (2761), 19 states have return successors, (3100), 2760 states have call predecessors, (3100), 2760 states have call successors, (3100) [2024-11-19 21:51:10,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16961 states to 16961 states and 28410 transitions. [2024-11-19 21:51:10,435 INFO L78 Accepts]: Start accepts. Automaton has 16961 states and 28410 transitions. Word has length 113 [2024-11-19 21:51:10,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:51:10,436 INFO L471 AbstractCegarLoop]: Abstraction has 16961 states and 28410 transitions. [2024-11-19 21:51:10,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (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-11-19 21:51:10,436 INFO L276 IsEmpty]: Start isEmpty. Operand 16961 states and 28410 transitions. [2024-11-19 21:51:10,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 21:51:10,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:51:10,448 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:51:10,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 21:51:10,448 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:51:10,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:51:10,448 INFO L85 PathProgramCache]: Analyzing trace with hash -791689921, now seen corresponding path program 1 times [2024-11-19 21:51:10,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:51:10,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773005206] [2024-11-19 21:51:10,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:10,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:51:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:10,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:51:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:10,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:51:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:10,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:51:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:10,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:51:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:10,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:51:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:10,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:51:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:10,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:51:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:10,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:51:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:10,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 21:51:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:10,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:51:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:10,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-19 21:51:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:51:10,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:51:10,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773005206] [2024-11-19 21:51:10,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773005206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:51:10,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:51:10,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:51:10,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128394478] [2024-11-19 21:51:10,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:51:10,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:51:10,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:51:10,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:51:10,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:51:10,524 INFO L87 Difference]: Start difference. First operand 16961 states and 28410 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (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-11-19 21:51:11,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:51:11,725 INFO L93 Difference]: Finished difference Result 45015 states and 76876 transitions. [2024-11-19 21:51:11,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:51:11,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (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 114 [2024-11-19 21:51:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:51:11,969 INFO L225 Difference]: With dead ends: 45015 [2024-11-19 21:51:11,969 INFO L226 Difference]: Without dead ends: 30432 [2024-11-19 21:51:11,997 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-11-19 21:51:11,998 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 778 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:51:11,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 852 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 21:51:12,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30432 states. [2024-11-19 21:51:13,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30432 to 30301. [2024-11-19 21:51:13,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30301 states, 25481 states have (on average 1.5859660138927043) internal successors, (40412), 25486 states have internal predecessors, (40412), 4800 states have call successors, (4800), 15 states have call predecessors, (4800), 19 states have return successors, (5413), 4799 states have call predecessors, (5413), 4799 states have call successors, (5413) [2024-11-19 21:51:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30301 states to 30301 states and 50625 transitions. [2024-11-19 21:51:13,378 INFO L78 Accepts]: Start accepts. Automaton has 30301 states and 50625 transitions. Word has length 114 [2024-11-19 21:51:13,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:51:13,379 INFO L471 AbstractCegarLoop]: Abstraction has 30301 states and 50625 transitions. [2024-11-19 21:51:13,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (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-11-19 21:51:13,380 INFO L276 IsEmpty]: Start isEmpty. Operand 30301 states and 50625 transitions. [2024-11-19 21:51:13,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 21:51:13,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:51:13,398 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:51:13,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 21:51:13,398 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:51:13,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:51:13,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1052143685, now seen corresponding path program 1 times [2024-11-19 21:51:13,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:51:13,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657141327] [2024-11-19 21:51:13,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:13,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:51:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:13,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:51:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:13,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:51:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:13,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:51:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:13,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:51:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:13,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:51:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:13,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:51:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:13,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 21:51:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:13,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:51:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:13,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 21:51:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:13,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:51:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:13,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-19 21:51:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:51:13,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:51:13,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657141327] [2024-11-19 21:51:13,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657141327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:51:13,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:51:13,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:51:13,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98360436] [2024-11-19 21:51:13,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:51:13,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:51:13,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:51:13,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:51:13,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:51:13,474 INFO L87 Difference]: Start difference. First operand 30301 states and 50625 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (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-11-19 21:51:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:51:15,486 INFO L93 Difference]: Finished difference Result 82752 states and 140400 transitions. [2024-11-19 21:51:15,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:51:15,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (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 115 [2024-11-19 21:51:15,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:51:15,871 INFO L225 Difference]: With dead ends: 82752 [2024-11-19 21:51:15,871 INFO L226 Difference]: Without dead ends: 55641 [2024-11-19 21:51:15,928 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-11-19 21:51:15,928 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 776 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:51:15,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 864 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 21:51:15,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55641 states. [2024-11-19 21:51:17,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55641 to 55510. [2024-11-19 21:51:17,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55510 states, 46975 states have (on average 1.580478978179883) internal successors, (74243), 46980 states have internal predecessors, (74243), 8515 states have call successors, (8515), 15 states have call predecessors, (8515), 19 states have return successors, (9660), 8514 states have call predecessors, (9660), 8514 states have call successors, (9660) [2024-11-19 21:51:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55510 states to 55510 states and 92418 transitions. [2024-11-19 21:51:17,995 INFO L78 Accepts]: Start accepts. Automaton has 55510 states and 92418 transitions. Word has length 115 [2024-11-19 21:51:17,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:51:17,996 INFO L471 AbstractCegarLoop]: Abstraction has 55510 states and 92418 transitions. [2024-11-19 21:51:17,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (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-11-19 21:51:17,996 INFO L276 IsEmpty]: Start isEmpty. Operand 55510 states and 92418 transitions. [2024-11-19 21:51:18,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 21:51:18,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:51:18,012 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:51:18,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 21:51:18,013 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:51:18,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:51:18,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1724726367, now seen corresponding path program 1 times [2024-11-19 21:51:18,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:51:18,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934857529] [2024-11-19 21:51:18,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:18,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:51:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:18,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:51:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:18,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:51:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:18,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:51:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:18,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:51:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:18,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:51:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:18,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:51:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:18,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 21:51:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:18,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:51:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:18,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-19 21:51:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:18,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-19 21:51:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:18,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-19 21:51:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:51:18,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:51:18,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934857529] [2024-11-19 21:51:18,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934857529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:51:18,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:51:18,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:51:18,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468882483] [2024-11-19 21:51:18,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:51:18,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:51:18,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:51:18,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:51:18,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:51:18,103 INFO L87 Difference]: Start difference. First operand 55510 states and 92418 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (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-11-19 21:51:20,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:51:20,681 INFO L93 Difference]: Finished difference Result 103808 states and 176386 transitions. [2024-11-19 21:51:20,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:51:20,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (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 116 [2024-11-19 21:51:20,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:51:21,040 INFO L225 Difference]: With dead ends: 103808 [2024-11-19 21:51:21,040 INFO L226 Difference]: Without dead ends: 103715 [2024-11-19 21:51:21,081 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-11-19 21:51:21,083 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 769 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:51:21,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 891 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 21:51:21,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103715 states. [2024-11-19 21:51:24,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103715 to 103584. [2024-11-19 21:51:24,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103584 states, 88250 states have (on average 1.573643059490085) internal successors, (138874), 88255 states have internal predecessors, (138874), 15314 states have call successors, (15314), 15 states have call predecessors, (15314), 19 states have return successors, (17505), 15313 states have call predecessors, (17505), 15313 states have call successors, (17505) [2024-11-19 21:51:24,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103584 states to 103584 states and 171693 transitions. [2024-11-19 21:51:24,430 INFO L78 Accepts]: Start accepts. Automaton has 103584 states and 171693 transitions. Word has length 116 [2024-11-19 21:51:24,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:51:24,431 INFO L471 AbstractCegarLoop]: Abstraction has 103584 states and 171693 transitions. [2024-11-19 21:51:24,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (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-11-19 21:51:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand 103584 states and 171693 transitions. [2024-11-19 21:51:24,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 21:51:24,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:51:24,447 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:51:24,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 21:51:24,447 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:51:24,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:51:24,447 INFO L85 PathProgramCache]: Analyzing trace with hash 726867652, now seen corresponding path program 1 times [2024-11-19 21:51:24,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:51:24,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816182322] [2024-11-19 21:51:24,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:24,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:51:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:25,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:51:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:25,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:51:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:25,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:51:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:25,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:51:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:25,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:51:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:25,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:51:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:25,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:51:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:25,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:51:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:25,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:51:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:25,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-19 21:51:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:25,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-19 21:51:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 21:51:25,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:51:25,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816182322] [2024-11-19 21:51:25,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816182322] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:51:25,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585942582] [2024-11-19 21:51:25,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:25,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:51:25,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:51:25,237 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:51:25,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 21:51:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:25,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 21:51:25,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:51:25,645 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 21:51:25,646 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:51:25,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585942582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:51:25,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:51:25,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [19] total 29 [2024-11-19 21:51:25,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632637330] [2024-11-19 21:51:25,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:51:25,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:51:25,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:51:25,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:51:25,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2024-11-19 21:51:25,648 INFO L87 Difference]: Start difference. First operand 103584 states and 171693 transitions. Second operand has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-19 21:51:27,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:51:27,930 INFO L93 Difference]: Finished difference Result 103794 states and 171968 transitions. [2024-11-19 21:51:27,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 21:51:27,931 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 117 [2024-11-19 21:51:27,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:51:28,262 INFO L225 Difference]: With dead ends: 103794 [2024-11-19 21:51:28,262 INFO L226 Difference]: Without dead ends: 103707 [2024-11-19 21:51:28,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=1462, Unknown=0, NotChecked=0, Total=1640 [2024-11-19 21:51:28,301 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 500 mSDsluCounter, 3133 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 3526 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:51:28,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 3526 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 21:51:28,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103707 states. [2024-11-19 21:51:31,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103707 to 103688. [2024-11-19 21:51:31,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103688 states, 88330 states have (on average 1.573429186007019) internal successors, (138981), 88335 states have internal predecessors, (138981), 15327 states have call successors, (15327), 24 states have call predecessors, (15327), 30 states have return successors, (17522), 15328 states have call predecessors, (17522), 15325 states have call successors, (17522) [2024-11-19 21:51:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103688 states to 103688 states and 171830 transitions. [2024-11-19 21:51:31,827 INFO L78 Accepts]: Start accepts. Automaton has 103688 states and 171830 transitions. Word has length 117 [2024-11-19 21:51:31,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:51:31,828 INFO L471 AbstractCegarLoop]: Abstraction has 103688 states and 171830 transitions. [2024-11-19 21:51:31,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-19 21:51:31,828 INFO L276 IsEmpty]: Start isEmpty. Operand 103688 states and 171830 transitions. [2024-11-19 21:51:31,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 21:51:31,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:51:31,843 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:51:31,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 21:51:32,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:51:32,043 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:51:32,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:51:32,044 INFO L85 PathProgramCache]: Analyzing trace with hash 2131257369, now seen corresponding path program 1 times [2024-11-19 21:51:32,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:51:32,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42167842] [2024-11-19 21:51:32,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:32,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:51:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:32,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:51:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:32,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:51:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:32,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:51:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:32,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:51:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:32,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:51:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:32,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:51:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:32,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:51:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:32,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:51:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:32,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:51:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:32,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-19 21:51:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:32,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-19 21:51:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:51:32,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:51:32,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42167842] [2024-11-19 21:51:32,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42167842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:51:32,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:51:32,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:51:32,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023752725] [2024-11-19 21:51:32,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:51:32,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:51:32,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:51:32,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:51:32,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:51:32,192 INFO L87 Difference]: Start difference. First operand 103688 states and 171830 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 5 states have internal predecessors, (81), 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-11-19 21:51:38,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:51:38,018 INFO L93 Difference]: Finished difference Result 203835 states and 344360 transitions. [2024-11-19 21:51:38,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 21:51:38,020 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 5 states have internal predecessors, (81), 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 118 [2024-11-19 21:51:38,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:51:38,701 INFO L225 Difference]: With dead ends: 203835 [2024-11-19 21:51:38,701 INFO L226 Difference]: Without dead ends: 203659 [2024-11-19 21:51:38,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2024-11-19 21:51:38,772 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1612 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1627 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 2258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 21:51:38,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1627 Valid, 1197 Invalid, 2258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 21:51:38,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203659 states. [2024-11-19 21:51:45,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203659 to 203241. [2024-11-19 21:51:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203241 states, 173175 states have (on average 1.5748635773061932) internal successors, (272727), 173184 states have internal predecessors, (272727), 30007 states have call successors, (30007), 45 states have call predecessors, (30007), 58 states have return successors, (32221), 30011 states have call predecessors, (32221), 30003 states have call successors, (32221) [2024-11-19 21:51:46,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203241 states to 203241 states and 334955 transitions. [2024-11-19 21:51:46,475 INFO L78 Accepts]: Start accepts. Automaton has 203241 states and 334955 transitions. Word has length 118 [2024-11-19 21:51:46,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:51:46,476 INFO L471 AbstractCegarLoop]: Abstraction has 203241 states and 334955 transitions. [2024-11-19 21:51:46,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 5 states have internal predecessors, (81), 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-11-19 21:51:46,476 INFO L276 IsEmpty]: Start isEmpty. Operand 203241 states and 334955 transitions. [2024-11-19 21:51:46,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 21:51:46,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:51:46,500 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:51:46,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 21:51:46,500 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:51:46,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:51:46,501 INFO L85 PathProgramCache]: Analyzing trace with hash 229960127, now seen corresponding path program 1 times [2024-11-19 21:51:46,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:51:46,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453158785] [2024-11-19 21:51:46,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:51:46,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:51:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:46,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:51:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:46,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:51:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:46,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:51:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:46,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:51:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:46,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:51:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:46,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:51:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:46,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:51:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:46,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:51:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:46,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:51:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:46,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-19 21:51:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:46,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-19 21:51:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:51:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:51:46,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:51:46,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453158785] [2024-11-19 21:51:46,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453158785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:51:46,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:51:46,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 21:51:46,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553248483] [2024-11-19 21:51:46,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:51:46,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 21:51:46,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:51:46,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 21:51:46,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:51:46,727 INFO L87 Difference]: Start difference. First operand 203241 states and 334955 transitions. Second operand has 14 states, 12 states have (on average 6.75) internal successors, (81), 9 states have internal predecessors, (81), 6 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11)