./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec11_product22.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/product-lines/email_spec11_product22.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 25d1aac916acb353bef6b5512adabc0f3abdf00fe5619505211974e4efa18990 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 14:58:20,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 14:58:20,216 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 14:58:20,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 14:58:20,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 14:58:20,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 14:58:20,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 14:58:20,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 14:58:20,247 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 14:58:20,248 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 14:58:20,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 14:58:20,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 14:58:20,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 14:58:20,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 14:58:20,249 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 14:58:20,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 14:58:20,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 14:58:20,250 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 14:58:20,250 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 14:58:20,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 14:58:20,251 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 14:58:20,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 14:58:20,253 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 14:58:20,253 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 14:58:20,254 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 14:58:20,254 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 14:58:20,254 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 14:58:20,254 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 14:58:20,255 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 14:58:20,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 14:58:20,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 14:58:20,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 14:58:20,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:58:20,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 14:58:20,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 14:58:20,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 14:58:20,260 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 14:58:20,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 14:58:20,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 14:58:20,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 14:58:20,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 14:58:20,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 14:58:20,261 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 -> 25d1aac916acb353bef6b5512adabc0f3abdf00fe5619505211974e4efa18990 [2024-11-08 14:58:20,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 14:58:20,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 14:58:20,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 14:58:20,469 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 14:58:20,470 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 14:58:20,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec11_product22.cil.c [2024-11-08 14:58:21,803 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 14:58:22,102 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 14:58:22,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product22.cil.c [2024-11-08 14:58:22,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9def2149/fdcdeb257dc546ab94703de0f15a7032/FLAG0e7faf5fc [2024-11-08 14:58:22,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9def2149/fdcdeb257dc546ab94703de0f15a7032 [2024-11-08 14:58:22,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 14:58:22,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 14:58:22,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 14:58:22,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 14:58:22,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 14:58:22,148 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:58:22" (1/1) ... [2024-11-08 14:58:22,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d820495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:58:22, skipping insertion in model container [2024-11-08 14:58:22,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:58:22" (1/1) ... [2024-11-08 14:58:22,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 14:58:22,572 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_product22.cil.c[40875,40888] [2024-11-08 14:58:22,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:58:22,682 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 14:58:22,692 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2024-11-08 14:58:22,693 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptAutoResponder_spec.i","") [66] [2024-11-08 14:58:22,693 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [99] [2024-11-08 14:58:22,693 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [210] [2024-11-08 14:58:22,694 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [520] [2024-11-08 14:58:22,694 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [749] [2024-11-08 14:58:22,694 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1822] [2024-11-08 14:58:22,694 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1831] [2024-11-08 14:58:22,694 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2119] [2024-11-08 14:58:22,694 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2485] [2024-11-08 14:58:22,695 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2520] [2024-11-08 14:58:22,744 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_product22.cil.c[40875,40888] [2024-11-08 14:58:22,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:58:22,805 INFO L204 MainTranslator]: Completed translation [2024-11-08 14:58:22,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:58:22 WrapperNode [2024-11-08 14:58:22,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 14:58:22,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 14:58:22,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 14:58:22,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 14:58:22,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:58:22" (1/1) ... [2024-11-08 14:58:22,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:58:22" (1/1) ... [2024-11-08 14:58:22,871 INFO L138 Inliner]: procedures = 128, calls = 189, calls flagged for inlining = 58, calls inlined = 53, statements flattened = 1018 [2024-11-08 14:58:22,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 14:58:22,872 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 14:58:22,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 14:58:22,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 14:58:22,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:58:22" (1/1) ... [2024-11-08 14:58:22,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:58:22" (1/1) ... [2024-11-08 14:58:22,886 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:58:22" (1/1) ... [2024-11-08 14:58:22,913 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-08 14:58:22,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:58:22" (1/1) ... [2024-11-08 14:58:22,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:58:22" (1/1) ... [2024-11-08 14:58:22,944 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:58:22" (1/1) ... [2024-11-08 14:58:22,963 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:58:22" (1/1) ... [2024-11-08 14:58:22,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:58:22" (1/1) ... [2024-11-08 14:58:22,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:58:22" (1/1) ... [2024-11-08 14:58:23,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 14:58:23,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 14:58:23,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 14:58:23,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 14:58:23,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:58:22" (1/1) ... [2024-11-08 14:58:23,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:58:23,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:58:23,047 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-08 14:58:23,051 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-08 14:58:23,091 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-11-08 14:58:23,091 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-11-08 14:58:23,091 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-11-08 14:58:23,091 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-11-08 14:58:23,091 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-08 14:58:23,091 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-08 14:58:23,092 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-08 14:58:23,092 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-08 14:58:23,092 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-08 14:58:23,093 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-08 14:58:23,093 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-08 14:58:23,093 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-08 14:58:23,093 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-11-08 14:58:23,094 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-11-08 14:58:23,094 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-08 14:58:23,094 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-08 14:58:23,095 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-08 14:58:23,095 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-08 14:58:23,095 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2024-11-08 14:58:23,095 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2024-11-08 14:58:23,095 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-08 14:58:23,095 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-08 14:58:23,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 14:58:23,095 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-08 14:58:23,095 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-08 14:58:23,095 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-08 14:58:23,095 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-08 14:58:23,096 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-08 14:58:23,096 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-08 14:58:23,096 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-08 14:58:23,096 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-08 14:58:23,096 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-11-08 14:58:23,096 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-11-08 14:58:23,096 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-08 14:58:23,096 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-08 14:58:23,096 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-08 14:58:23,096 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-08 14:58:23,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 14:58:23,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 14:58:23,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 14:58:23,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 14:58:23,097 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-08 14:58:23,097 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-08 14:58:23,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 14:58:23,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 14:58:23,306 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 14:58:23,308 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 14:58:24,062 INFO L? ?]: Removed 433 outVars from TransFormulas that were not future-live. [2024-11-08 14:58:24,063 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 14:58:24,080 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 14:58:24,080 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 14:58:24,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:58:24 BoogieIcfgContainer [2024-11-08 14:58:24,081 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 14:58:24,082 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 14:58:24,082 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 14:58:24,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 14:58:24,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 02:58:22" (1/3) ... [2024-11-08 14:58:24,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1c7add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:58:24, skipping insertion in model container [2024-11-08 14:58:24,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:58:22" (2/3) ... [2024-11-08 14:58:24,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1c7add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:58:24, skipping insertion in model container [2024-11-08 14:58:24,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:58:24" (3/3) ... [2024-11-08 14:58:24,087 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec11_product22.cil.c [2024-11-08 14:58:24,100 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 14:58:24,100 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 14:58:24,155 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 14:58:24,161 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;@2b966c48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 14:58:24,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 14:58:24,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 322 states, 251 states have (on average 1.5258964143426295) internal successors, (383), 255 states have internal predecessors, (383), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 14:58:24,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 14:58:24,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:58:24,192 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-08 14:58:24,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:58:24,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:58:24,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1149168314, now seen corresponding path program 1 times [2024-11-08 14:58:24,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:58:24,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786700419] [2024-11-08 14:58:24,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:24,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:58:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:24,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:58:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:24,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:58:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:24,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:58:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:24,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 14:58:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:24,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 14:58:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:24,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 14:58:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:24,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 14:58:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:24,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-08 14:58:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:24,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 14:58:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:24,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 14:58:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:24,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 14:58:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:24,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 14:58:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:24,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:58:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:24,851 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 14:58:24,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:58:24,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786700419] [2024-11-08 14:58:24,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786700419] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:58:24,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846763969] [2024-11-08 14:58:24,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:24,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:58:24,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:58:24,855 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-08 14:58:24,859 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-08 14:58:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:25,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 14:58:25,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:58:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 14:58:25,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:58:25,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846763969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:58:25,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 14:58:25,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-08 14:58:25,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488854620] [2024-11-08 14:58:25,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:58:25,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 14:58:25,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:58:25,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 14:58:25,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 14:58:25,216 INFO L87 Difference]: Start difference. First operand has 322 states, 251 states have (on average 1.5258964143426295) internal successors, (383), 255 states have internal predecessors, (383), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:25,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:58:25,252 INFO L93 Difference]: Finished difference Result 485 states and 712 transitions. [2024-11-08 14:58:25,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 14:58:25,254 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2024-11-08 14:58:25,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:58:25,267 INFO L225 Difference]: With dead ends: 485 [2024-11-08 14:58:25,267 INFO L226 Difference]: Without dead ends: 315 [2024-11-08 14:58:25,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 131 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-08 14:58:25,278 INFO L432 NwaCegarLoop]: 479 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, 479 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-08 14:58:25,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:58:25,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-08 14:58:25,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2024-11-08 14:58:25,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 245 states have (on average 1.5183673469387755) internal successors, (372), 248 states have internal predecessors, (372), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-08 14:58:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 471 transitions. [2024-11-08 14:58:25,379 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 471 transitions. Word has length 109 [2024-11-08 14:58:25,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:58:25,380 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 471 transitions. [2024-11-08 14:58:25,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:25,384 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 471 transitions. [2024-11-08 14:58:25,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 14:58:25,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:58:25,392 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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-08 14:58:25,422 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-08 14:58:25,593 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-08 14:58:25,594 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:58:25,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:58:25,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1245386825, now seen corresponding path program 1 times [2024-11-08 14:58:25,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:58:25,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076294258] [2024-11-08 14:58:25,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:25,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:58:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:25,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:58:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:25,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:58:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:25,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:58:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:25,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 14:58:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:25,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 14:58:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:25,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 14:58:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:25,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 14:58:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:25,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 14:58:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:25,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 14:58:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:25,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 14:58:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:25,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 14:58:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:25,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 14:58:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:25,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:58:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 14:58:25,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:58:25,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076294258] [2024-11-08 14:58:25,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076294258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:58:25,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907627774] [2024-11-08 14:58:25,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:25,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:58:25,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:58:25,933 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-08 14:58:25,939 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-08 14:58:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:26,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 14:58:26,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:58:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 14:58:26,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:58:26,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907627774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:58:26,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 14:58:26,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-08 14:58:26,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590253394] [2024-11-08 14:58:26,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:58:26,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 14:58:26,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:58:26,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 14:58:26,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:58:26,263 INFO L87 Difference]: Start difference. First operand 315 states and 471 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:26,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:58:26,314 INFO L93 Difference]: Finished difference Result 475 states and 693 transitions. [2024-11-08 14:58:26,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 14:58:26,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2024-11-08 14:58:26,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:58:26,318 INFO L225 Difference]: With dead ends: 475 [2024-11-08 14:58:26,321 INFO L226 Difference]: Without dead ends: 318 [2024-11-08 14:58:26,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 131 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-08 14:58:26,323 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 1 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 936 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-08 14:58:26,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 936 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:58:26,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-08 14:58:26,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2024-11-08 14:58:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 247 states have (on average 1.51417004048583) internal successors, (374), 250 states have internal predecessors, (374), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-08 14:58:26,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 473 transitions. [2024-11-08 14:58:26,348 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 473 transitions. Word has length 110 [2024-11-08 14:58:26,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:58:26,349 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 473 transitions. [2024-11-08 14:58:26,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:26,349 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 473 transitions. [2024-11-08 14:58:26,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 14:58:26,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:58:26,351 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:58:26,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 14:58:26,552 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-08 14:58:26,553 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:58:26,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:58:26,554 INFO L85 PathProgramCache]: Analyzing trace with hash -851498853, now seen corresponding path program 1 times [2024-11-08 14:58:26,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:58:26,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790017231] [2024-11-08 14:58:26,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:26,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:58:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:26,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:58:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:26,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:58:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:26,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:58:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:26,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 14:58:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:26,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 14:58:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:26,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 14:58:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:26,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 14:58:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:26,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 14:58:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:26,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 14:58:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:26,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 14:58:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:26,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 14:58:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:26,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 14:58:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:26,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:58:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:26,765 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 14:58:26,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:58:26,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790017231] [2024-11-08 14:58:26,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790017231] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:58:26,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746803706] [2024-11-08 14:58:26,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:26,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:58:26,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:58:26,769 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-08 14:58:26,771 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-08 14:58:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:26,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 14:58:26,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:58:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 14:58:27,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:58:27,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746803706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:58:27,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 14:58:27,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-08 14:58:27,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133436179] [2024-11-08 14:58:27,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:58:27,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 14:58:27,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:58:27,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 14:58:27,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:58:27,014 INFO L87 Difference]: Start difference. First operand 317 states and 473 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:27,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:58:27,033 INFO L93 Difference]: Finished difference Result 669 states and 1013 transitions. [2024-11-08 14:58:27,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 14:58:27,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 119 [2024-11-08 14:58:27,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:58:27,037 INFO L225 Difference]: With dead ends: 669 [2024-11-08 14:58:27,038 INFO L226 Difference]: Without dead ends: 379 [2024-11-08 14:58:27,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 140 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-08 14:58:27,039 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 115 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 915 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-08 14:58:27,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 915 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:58:27,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-08 14:58:27,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 371. [2024-11-08 14:58:27,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 290 states have (on average 1.5310344827586206) internal successors, (444), 293 states have internal predecessors, (444), 61 states have call successors, (61), 19 states have call predecessors, (61), 19 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 14:58:27,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 565 transitions. [2024-11-08 14:58:27,056 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 565 transitions. Word has length 119 [2024-11-08 14:58:27,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:58:27,056 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 565 transitions. [2024-11-08 14:58:27,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:27,057 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 565 transitions. [2024-11-08 14:58:27,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 14:58:27,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:58:27,058 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:58:27,072 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-08 14:58:27,262 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-08 14:58:27,263 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:58:27,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:58:27,264 INFO L85 PathProgramCache]: Analyzing trace with hash 987425348, now seen corresponding path program 1 times [2024-11-08 14:58:27,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:58:27,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746778998] [2024-11-08 14:58:27,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:27,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:58:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:27,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:58:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:27,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:58:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:27,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:58:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:27,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 14:58:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:27,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 14:58:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:27,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 14:58:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:27,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-08 14:58:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:27,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-08 14:58:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:27,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 14:58:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:27,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 14:58:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:27,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 14:58:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:27,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 14:58:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:27,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:58:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:27,420 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 14:58:27,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:58:27,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746778998] [2024-11-08 14:58:27,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746778998] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:58:27,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653345247] [2024-11-08 14:58:27,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:27,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:58:27,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:58:27,422 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-08 14:58:27,423 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-08 14:58:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:27,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 14:58:27,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:58:27,718 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 14:58:27,718 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:58:27,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653345247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:58:27,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 14:58:27,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-08 14:58:27,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238673314] [2024-11-08 14:58:27,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:58:27,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:58:27,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:58:27,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:58:27,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-08 14:58:27,720 INFO L87 Difference]: Start difference. First operand 371 states and 565 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 14:58:27,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:58:27,769 INFO L93 Difference]: Finished difference Result 733 states and 1120 transitions. [2024-11-08 14:58:27,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 14:58:27,769 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 120 [2024-11-08 14:58:27,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:58:27,771 INFO L225 Difference]: With dead ends: 733 [2024-11-08 14:58:27,772 INFO L226 Difference]: Without dead ends: 373 [2024-11-08 14:58:27,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 139 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-08 14:58:27,773 INFO L432 NwaCegarLoop]: 463 mSDtfsCounter, 2 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1841 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-08 14:58:27,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1841 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:58:27,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-08 14:58:27,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2024-11-08 14:58:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 291 states have (on average 1.529209621993127) internal successors, (445), 295 states have internal predecessors, (445), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (62), 60 states have call predecessors, (62), 60 states have call successors, (62) [2024-11-08 14:58:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 568 transitions. [2024-11-08 14:58:27,795 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 568 transitions. Word has length 120 [2024-11-08 14:58:27,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:58:27,795 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 568 transitions. [2024-11-08 14:58:27,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 14:58:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 568 transitions. [2024-11-08 14:58:27,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-08 14:58:27,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:58:27,798 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:58:27,813 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-08 14:58:27,999 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-08 14:58:28,000 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:58:28,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:58:28,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1500748921, now seen corresponding path program 1 times [2024-11-08 14:58:28,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:58:28,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591415038] [2024-11-08 14:58:28,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:28,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:58:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:58:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:58:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:58:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:58:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 14:58:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 14:58:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 14:58:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 14:58:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 14:58:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 14:58:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 14:58:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 14:58:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:58:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 14:58:28,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:58:28,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591415038] [2024-11-08 14:58:28,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591415038] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:58:28,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092777315] [2024-11-08 14:58:28,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:28,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:58:28,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:58:28,224 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-08 14:58:28,225 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-08 14:58:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 14:58:28,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:58:28,489 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 14:58:28,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:58:28,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092777315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:58:28,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 14:58:28,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-08 14:58:28,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568966402] [2024-11-08 14:58:28,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:58:28,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:58:28,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:58:28,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:58:28,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-08 14:58:28,494 INFO L87 Difference]: Start difference. First operand 373 states and 568 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 14:58:28,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:58:28,552 INFO L93 Difference]: Finished difference Result 735 states and 1125 transitions. [2024-11-08 14:58:28,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 14:58:28,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 121 [2024-11-08 14:58:28,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:58:28,555 INFO L225 Difference]: With dead ends: 735 [2024-11-08 14:58:28,555 INFO L226 Difference]: Without dead ends: 375 [2024-11-08 14:58:28,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 139 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-08 14:58:28,557 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 2 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1827 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-08 14:58:28,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1827 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:58:28,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-08 14:58:28,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2024-11-08 14:58:28,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 292 states have (on average 1.5273972602739727) internal successors, (446), 297 states have internal predecessors, (446), 61 states have call successors, (61), 19 states have call predecessors, (61), 21 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2024-11-08 14:58:28,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 574 transitions. [2024-11-08 14:58:28,573 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 574 transitions. Word has length 121 [2024-11-08 14:58:28,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:58:28,573 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 574 transitions. [2024-11-08 14:58:28,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 14:58:28,573 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 574 transitions. [2024-11-08 14:58:28,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-08 14:58:28,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:58:28,576 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:58:28,592 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-08 14:58:28,777 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-08 14:58:28,778 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:58:28,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:58:28,778 INFO L85 PathProgramCache]: Analyzing trace with hash -193155827, now seen corresponding path program 1 times [2024-11-08 14:58:28,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:58:28,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783715724] [2024-11-08 14:58:28,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:28,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:58:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:58:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:58:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:58:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:58:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:58:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 14:58:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 14:58:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 14:58:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 14:58:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 14:58:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 14:58:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 14:58:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:58:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:28,958 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 14:58:28,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:58:28,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783715724] [2024-11-08 14:58:28,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783715724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:58:28,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:58:28,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 14:58:28,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394522466] [2024-11-08 14:58:28,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:58:28,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 14:58:28,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:58:28,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 14:58:28,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 14:58:28,960 INFO L87 Difference]: Start difference. First operand 375 states and 574 transitions. Second operand has 9 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 14:58:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:58:30,610 INFO L93 Difference]: Finished difference Result 888 states and 1370 transitions. [2024-11-08 14:58:30,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 14:58:30,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 122 [2024-11-08 14:58:30,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:58:30,614 INFO L225 Difference]: With dead ends: 888 [2024-11-08 14:58:30,615 INFO L226 Difference]: Without dead ends: 536 [2024-11-08 14:58:30,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-08 14:58:30,616 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1029 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 2703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 14:58:30,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 1172 Invalid, 2703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 2369 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 14:58:30,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-08 14:58:30,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 375. [2024-11-08 14:58:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 292 states have (on average 1.5273972602739727) internal successors, (446), 297 states have internal predecessors, (446), 61 states have call successors, (61), 19 states have call predecessors, (61), 21 states have return successors, (66), 60 states have call predecessors, (66), 60 states have call successors, (66) [2024-11-08 14:58:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 573 transitions. [2024-11-08 14:58:30,648 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 573 transitions. Word has length 122 [2024-11-08 14:58:30,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:58:30,648 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 573 transitions. [2024-11-08 14:58:30,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 14:58:30,648 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 573 transitions. [2024-11-08 14:58:30,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 14:58:30,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:58:30,650 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:58:30,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 14:58:30,651 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:58:30,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:58:30,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1864950748, now seen corresponding path program 2 times [2024-11-08 14:58:30,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:58:30,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355547922] [2024-11-08 14:58:30,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:30,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:58:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:30,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:58:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:30,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:58:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:30,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:58:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:30,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:58:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:30,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:58:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:30,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 14:58:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:30,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 14:58:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:30,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 14:58:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:30,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 14:58:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:30,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 14:58:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:30,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 14:58:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:30,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 14:58:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:30,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:58:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:30,817 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 14:58:30,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:58:30,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355547922] [2024-11-08 14:58:30,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355547922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:58:30,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:58:30,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 14:58:30,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615730547] [2024-11-08 14:58:30,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:58:30,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 14:58:30,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:58:30,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 14:58:30,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 14:58:30,819 INFO L87 Difference]: Start difference. First operand 375 states and 573 transitions. Second operand has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 14:58:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:58:32,368 INFO L93 Difference]: Finished difference Result 890 states and 1373 transitions. [2024-11-08 14:58:32,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 14:58:32,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 123 [2024-11-08 14:58:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:58:32,371 INFO L225 Difference]: With dead ends: 890 [2024-11-08 14:58:32,371 INFO L226 Difference]: Without dead ends: 538 [2024-11-08 14:58:32,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-08 14:58:32,373 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 995 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 2754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 14:58:32,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 1172 Invalid, 2754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 2430 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 14:58:32,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-08 14:58:32,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 377. [2024-11-08 14:58:32,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 293 states have (on average 1.5255972696245734) internal successors, (447), 299 states have internal predecessors, (447), 61 states have call successors, (61), 19 states have call predecessors, (61), 22 states have return successors, (68), 60 states have call predecessors, (68), 60 states have call successors, (68) [2024-11-08 14:58:32,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 576 transitions. [2024-11-08 14:58:32,401 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 576 transitions. Word has length 123 [2024-11-08 14:58:32,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:58:32,402 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 576 transitions. [2024-11-08 14:58:32,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 14:58:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 576 transitions. [2024-11-08 14:58:32,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 14:58:32,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:58:32,404 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:58:32,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 14:58:32,405 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:58:32,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:58:32,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1804730952, now seen corresponding path program 1 times [2024-11-08 14:58:32,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:58:32,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345492408] [2024-11-08 14:58:32,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:32,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:58:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:32,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:58:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:32,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:58:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:32,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:58:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:32,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:58:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:32,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:58:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:32,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:58:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:32,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 14:58:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:32,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 14:58:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:32,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 14:58:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:32,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 14:58:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:32,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 14:58:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:32,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 14:58:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:32,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:58:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:32,594 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 14:58:32,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:58:32,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345492408] [2024-11-08 14:58:32,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345492408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:58:32,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:58:32,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 14:58:32,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567398562] [2024-11-08 14:58:32,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:58:32,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 14:58:32,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:58:32,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 14:58:32,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-08 14:58:32,598 INFO L87 Difference]: Start difference. First operand 377 states and 576 transitions. Second operand has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-08 14:58:34,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:58:34,695 INFO L93 Difference]: Finished difference Result 888 states and 1368 transitions. [2024-11-08 14:58:34,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 14:58:34,696 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 124 [2024-11-08 14:58:34,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:58:34,701 INFO L225 Difference]: With dead ends: 888 [2024-11-08 14:58:34,702 INFO L226 Difference]: Without dead ends: 538 [2024-11-08 14:58:34,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-08 14:58:34,704 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 997 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 4015 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 4339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 4015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 14:58:34,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 1623 Invalid, 4339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 4015 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 14:58:34,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-08 14:58:34,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 377. [2024-11-08 14:58:34,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 293 states have (on average 1.5255972696245734) internal successors, (447), 299 states have internal predecessors, (447), 61 states have call successors, (61), 19 states have call predecessors, (61), 22 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2024-11-08 14:58:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 575 transitions. [2024-11-08 14:58:34,727 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 575 transitions. Word has length 124 [2024-11-08 14:58:34,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:58:34,727 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 575 transitions. [2024-11-08 14:58:34,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-08 14:58:34,728 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 575 transitions. [2024-11-08 14:58:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 14:58:34,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:58:34,729 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:58:34,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 14:58:34,729 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:58:34,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:58:34,730 INFO L85 PathProgramCache]: Analyzing trace with hash 939693494, now seen corresponding path program 2 times [2024-11-08 14:58:34,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:58:34,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298427398] [2024-11-08 14:58:34,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:34,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:58:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:34,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:58:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:34,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:58:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:34,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:58:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:34,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:58:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:34,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:58:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:34,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:58:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:34,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-08 14:58:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:34,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 14:58:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:34,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 14:58:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:34,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 14:58:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:34,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 14:58:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:34,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 14:58:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:34,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:58:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:34,919 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-08 14:58:34,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:58:34,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298427398] [2024-11-08 14:58:34,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298427398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:58:34,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:58:34,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 14:58:34,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007585204] [2024-11-08 14:58:34,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:58:34,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 14:58:34,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:58:34,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 14:58:34,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-08 14:58:34,921 INFO L87 Difference]: Start difference. First operand 377 states and 575 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-08 14:58:36,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:58:36,993 INFO L93 Difference]: Finished difference Result 890 states and 1374 transitions. [2024-11-08 14:58:36,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 14:58:36,993 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 125 [2024-11-08 14:58:36,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:58:36,996 INFO L225 Difference]: With dead ends: 890 [2024-11-08 14:58:36,997 INFO L226 Difference]: Without dead ends: 540 [2024-11-08 14:58:36,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-08 14:58:36,998 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 992 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 4036 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 4363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 4036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 14:58:36,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 1624 Invalid, 4363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 4036 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 14:58:36,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-08 14:58:37,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 379. [2024-11-08 14:58:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 294 states have (on average 1.5238095238095237) internal successors, (448), 301 states have internal predecessors, (448), 61 states have call successors, (61), 19 states have call predecessors, (61), 23 states have return successors, (72), 60 states have call predecessors, (72), 60 states have call successors, (72) [2024-11-08 14:58:37,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 581 transitions. [2024-11-08 14:58:37,045 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 581 transitions. Word has length 125 [2024-11-08 14:58:37,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:58:37,046 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 581 transitions. [2024-11-08 14:58:37,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-08 14:58:37,046 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 581 transitions. [2024-11-08 14:58:37,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 14:58:37,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:58:37,049 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:58:37,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 14:58:37,050 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:58:37,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:58:37,050 INFO L85 PathProgramCache]: Analyzing trace with hash -484736349, now seen corresponding path program 1 times [2024-11-08 14:58:37,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:58:37,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744757095] [2024-11-08 14:58:37,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:37,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:58:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:37,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:58:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:37,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:58:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:37,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:58:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:37,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:58:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:37,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:58:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:37,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:58:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:37,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 14:58:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:37,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 14:58:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:37,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 14:58:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:37,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 14:58:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:37,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 14:58:37,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:37,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 14:58:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:37,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:58:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 14:58:37,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:58:37,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744757095] [2024-11-08 14:58:37,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744757095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:58:37,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040732930] [2024-11-08 14:58:37,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:37,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:58:37,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:58:37,300 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-08 14:58:37,301 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-08 14:58:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:37,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 14:58:37,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:58:37,565 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 14:58:37,565 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:58:37,651 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 14:58:37,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040732930] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:58:37,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:58:37,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-11-08 14:58:37,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41059041] [2024-11-08 14:58:37,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:58:37,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 14:58:37,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:58:37,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 14:58:37,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-08 14:58:37,654 INFO L87 Difference]: Start difference. First operand 379 states and 581 transitions. Second operand has 15 states, 14 states have (on average 9.785714285714286) internal successors, (137), 11 states have internal predecessors, (137), 4 states have call successors, (31), 6 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-08 14:58:40,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:58:40,223 INFO L93 Difference]: Finished difference Result 1265 states and 2046 transitions. [2024-11-08 14:58:40,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 14:58:40,224 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 9.785714285714286) internal successors, (137), 11 states have internal predecessors, (137), 4 states have call successors, (31), 6 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 126 [2024-11-08 14:58:40,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:58:40,228 INFO L225 Difference]: With dead ends: 1265 [2024-11-08 14:58:40,228 INFO L226 Difference]: Without dead ends: 917 [2024-11-08 14:58:40,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 273 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-08 14:58:40,230 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 2129 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 4897 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2146 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 5561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 4897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 14:58:40,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2146 Valid, 1922 Invalid, 5561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 4897 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 14:58:40,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2024-11-08 14:58:40,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 732. [2024-11-08 14:58:40,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 583 states have (on average 1.5763293310463122) internal successors, (919), 590 states have internal predecessors, (919), 125 states have call successors, (125), 19 states have call predecessors, (125), 23 states have return successors, (146), 124 states have call predecessors, (146), 124 states have call successors, (146) [2024-11-08 14:58:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1190 transitions. [2024-11-08 14:58:40,262 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1190 transitions. Word has length 126 [2024-11-08 14:58:40,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:58:40,262 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 1190 transitions. [2024-11-08 14:58:40,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 9.785714285714286) internal successors, (137), 11 states have internal predecessors, (137), 4 states have call successors, (31), 6 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-08 14:58:40,262 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1190 transitions. [2024-11-08 14:58:40,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 14:58:40,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:58:40,265 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:58:40,281 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-08 14:58:40,466 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-08 14:58:40,466 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:58:40,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:58:40,467 INFO L85 PathProgramCache]: Analyzing trace with hash 301333461, now seen corresponding path program 1 times [2024-11-08 14:58:40,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:58:40,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472075793] [2024-11-08 14:58:40,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:40,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:58:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:40,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:58:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:40,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:58:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:40,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:58:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:40,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:58:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:40,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:58:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:40,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:58:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:40,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 14:58:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:40,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 14:58:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:40,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 14:58:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:40,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 14:58:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:40,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 14:58:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:40,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 14:58:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:40,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:58:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 14:58:40,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:58:40,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472075793] [2024-11-08 14:58:40,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472075793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:58:40,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:58:40,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:58:40,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030277339] [2024-11-08 14:58:40,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:58:40,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:58:40,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:58:40,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:58:40,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:58:40,560 INFO L87 Difference]: Start difference. First operand 732 states and 1190 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:41,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:58:41,719 INFO L93 Difference]: Finished difference Result 1880 states and 3125 transitions. [2024-11-08 14:58:41,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 14:58:41,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2024-11-08 14:58:41,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:58:41,725 INFO L225 Difference]: With dead ends: 1880 [2024-11-08 14:58:41,725 INFO L226 Difference]: Without dead ends: 1226 [2024-11-08 14:58:41,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 14:58:41,728 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 1118 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:58:41,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1133 Valid, 890 Invalid, 1789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 14:58:41,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2024-11-08 14:58:41,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1057. [2024-11-08 14:58:41,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 844 states have (on average 1.5924170616113744) internal successors, (1344), 851 states have internal predecessors, (1344), 189 states have call successors, (189), 19 states have call predecessors, (189), 23 states have return successors, (220), 188 states have call predecessors, (220), 188 states have call successors, (220) [2024-11-08 14:58:41,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1753 transitions. [2024-11-08 14:58:41,766 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1753 transitions. Word has length 129 [2024-11-08 14:58:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:58:41,766 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1753 transitions. [2024-11-08 14:58:41,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:41,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1753 transitions. [2024-11-08 14:58:41,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 14:58:41,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:58:41,770 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:58:41,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 14:58:41,771 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:58:41,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:58:41,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1526328097, now seen corresponding path program 1 times [2024-11-08 14:58:41,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:58:41,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976983197] [2024-11-08 14:58:41,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:41,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:58:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:41,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:58:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:41,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:58:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:41,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:58:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:41,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:58:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:41,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:58:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:41,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:58:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:41,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 14:58:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:41,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 14:58:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:41,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 14:58:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:41,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 14:58:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:41,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 14:58:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:41,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 14:58:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:41,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:58:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 14:58:41,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:58:41,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976983197] [2024-11-08 14:58:41,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976983197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:58:41,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:58:41,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:58:41,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496478331] [2024-11-08 14:58:41,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:58:41,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:58:41,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:58:41,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:58:41,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:58:41,858 INFO L87 Difference]: Start difference. First operand 1057 states and 1753 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:58:42,988 INFO L93 Difference]: Finished difference Result 2685 states and 4509 transitions. [2024-11-08 14:58:42,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 14:58:42,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 130 [2024-11-08 14:58:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:58:42,996 INFO L225 Difference]: With dead ends: 2685 [2024-11-08 14:58:42,996 INFO L226 Difference]: Without dead ends: 1759 [2024-11-08 14:58:42,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 14:58:42,999 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1101 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1116 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 1767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:58:43,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1116 Valid, 861 Invalid, 1767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 14:58:43,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2024-11-08 14:58:43,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1590. [2024-11-08 14:58:43,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1282 states have (on average 1.5990639625585024) internal successors, (2050), 1289 states have internal predecessors, (2050), 284 states have call successors, (284), 19 states have call predecessors, (284), 23 states have return successors, (315), 283 states have call predecessors, (315), 283 states have call successors, (315) [2024-11-08 14:58:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 2649 transitions. [2024-11-08 14:58:43,050 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 2649 transitions. Word has length 130 [2024-11-08 14:58:43,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:58:43,050 INFO L471 AbstractCegarLoop]: Abstraction has 1590 states and 2649 transitions. [2024-11-08 14:58:43,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:43,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2649 transitions. [2024-11-08 14:58:43,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 14:58:43,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:58:43,056 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:58:43,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 14:58:43,057 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:58:43,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:58:43,057 INFO L85 PathProgramCache]: Analyzing trace with hash -923643037, now seen corresponding path program 1 times [2024-11-08 14:58:43,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:58:43,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574351980] [2024-11-08 14:58:43,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:43,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:58:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:43,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:58:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:43,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:58:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:43,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:58:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:43,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:58:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:43,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:58:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:43,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:58:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:43,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 14:58:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:43,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 14:58:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:43,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 14:58:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:43,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 14:58:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:43,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 14:58:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:43,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 14:58:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:43,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:58:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 14:58:43,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:58:43,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574351980] [2024-11-08 14:58:43,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574351980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:58:43,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:58:43,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:58:43,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421320594] [2024-11-08 14:58:43,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:58:43,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:58:43,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:58:43,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:58:43,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:58:43,141 INFO L87 Difference]: Start difference. First operand 1590 states and 2649 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:44,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:58:44,352 INFO L93 Difference]: Finished difference Result 3892 states and 6595 transitions. [2024-11-08 14:58:44,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 14:58:44,353 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 131 [2024-11-08 14:58:44,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:58:44,364 INFO L225 Difference]: With dead ends: 3892 [2024-11-08 14:58:44,364 INFO L226 Difference]: Without dead ends: 2568 [2024-11-08 14:58:44,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 14:58:44,369 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1132 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:58:44,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1147 Valid, 856 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 1358 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 14:58:44,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2024-11-08 14:58:44,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2399. [2024-11-08 14:58:44,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2399 states, 1968 states have (on average 1.6041666666666667) internal successors, (3157), 1975 states have internal predecessors, (3157), 407 states have call successors, (407), 19 states have call predecessors, (407), 23 states have return successors, (454), 406 states have call predecessors, (454), 406 states have call successors, (454) [2024-11-08 14:58:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2399 states to 2399 states and 4018 transitions. [2024-11-08 14:58:44,439 INFO L78 Accepts]: Start accepts. Automaton has 2399 states and 4018 transitions. Word has length 131 [2024-11-08 14:58:44,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:58:44,439 INFO L471 AbstractCegarLoop]: Abstraction has 2399 states and 4018 transitions. [2024-11-08 14:58:44,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:44,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2399 states and 4018 transitions. [2024-11-08 14:58:44,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 14:58:44,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:58:44,447 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:58:44,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 14:58:44,447 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:58:44,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:58:44,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1090726272, now seen corresponding path program 1 times [2024-11-08 14:58:44,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:58:44,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685152065] [2024-11-08 14:58:44,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:44,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:58:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:44,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:58:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:44,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:58:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:44,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:58:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:44,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:58:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:44,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:58:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:44,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:58:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:44,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 14:58:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:44,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 14:58:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:44,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 14:58:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:44,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 14:58:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:44,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 14:58:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:44,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 14:58:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:44,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:58:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:44,524 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 14:58:44,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:58:44,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685152065] [2024-11-08 14:58:44,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685152065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:58:44,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:58:44,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:58:44,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478090368] [2024-11-08 14:58:44,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:58:44,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:58:44,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:58:44,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:58:44,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:58:44,526 INFO L87 Difference]: Start difference. First operand 2399 states and 4018 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:45,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:58:45,693 INFO L93 Difference]: Finished difference Result 5776 states and 9855 transitions. [2024-11-08 14:58:45,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 14:58:45,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 132 [2024-11-08 14:58:45,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:58:45,709 INFO L225 Difference]: With dead ends: 5776 [2024-11-08 14:58:45,709 INFO L226 Difference]: Without dead ends: 3862 [2024-11-08 14:58:45,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 14:58:45,715 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1130 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:58:45,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 856 Invalid, 1750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 14:58:45,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3862 states. [2024-11-08 14:58:45,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3862 to 3693. [2024-11-08 14:58:45,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3693 states, 3083 states have (on average 1.6072007784625364) internal successors, (4955), 3090 states have internal predecessors, (4955), 586 states have call successors, (586), 19 states have call predecessors, (586), 23 states have return successors, (659), 585 states have call predecessors, (659), 585 states have call successors, (659) [2024-11-08 14:58:45,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3693 states to 3693 states and 6200 transitions. [2024-11-08 14:58:45,827 INFO L78 Accepts]: Start accepts. Automaton has 3693 states and 6200 transitions. Word has length 132 [2024-11-08 14:58:45,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:58:45,828 INFO L471 AbstractCegarLoop]: Abstraction has 3693 states and 6200 transitions. [2024-11-08 14:58:45,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:45,828 INFO L276 IsEmpty]: Start isEmpty. Operand 3693 states and 6200 transitions. [2024-11-08 14:58:45,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 14:58:45,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:58:45,838 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:58:45,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 14:58:45,838 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:58:45,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:58:45,838 INFO L85 PathProgramCache]: Analyzing trace with hash -421295841, now seen corresponding path program 1 times [2024-11-08 14:58:45,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:58:45,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567140750] [2024-11-08 14:58:45,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:45,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:58:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:45,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:58:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:45,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:58:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:45,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:58:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:45,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:58:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:45,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:58:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:45,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:58:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:45,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 14:58:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:45,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 14:58:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:45,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 14:58:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:45,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 14:58:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:45,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 14:58:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:45,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 14:58:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:45,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:58:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:45,921 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 14:58:45,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:58:45,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567140750] [2024-11-08 14:58:45,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567140750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:58:45,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:58:45,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:58:45,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266451891] [2024-11-08 14:58:45,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:58:45,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:58:45,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:58:45,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:58:45,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:58:45,925 INFO L87 Difference]: Start difference. First operand 3693 states and 6200 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:47,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:58:47,224 INFO L93 Difference]: Finished difference Result 8879 states and 15219 transitions. [2024-11-08 14:58:47,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 14:58:47,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 133 [2024-11-08 14:58:47,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:58:47,252 INFO L225 Difference]: With dead ends: 8879 [2024-11-08 14:58:47,252 INFO L226 Difference]: Without dead ends: 6003 [2024-11-08 14:58:47,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 14:58:47,263 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1142 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 1769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:58:47,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 876 Invalid, 1769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 14:58:47,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6003 states. [2024-11-08 14:58:47,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6003 to 5834. [2024-11-08 14:58:47,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5834 states, 4848 states have (on average 1.6008663366336633) internal successors, (7761), 4855 states have internal predecessors, (7761), 962 states have call successors, (962), 19 states have call predecessors, (962), 23 states have return successors, (1079), 961 states have call predecessors, (1079), 961 states have call successors, (1079) [2024-11-08 14:58:47,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5834 states to 5834 states and 9802 transitions. [2024-11-08 14:58:47,535 INFO L78 Accepts]: Start accepts. Automaton has 5834 states and 9802 transitions. Word has length 133 [2024-11-08 14:58:47,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:58:47,539 INFO L471 AbstractCegarLoop]: Abstraction has 5834 states and 9802 transitions. [2024-11-08 14:58:47,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 5834 states and 9802 transitions. [2024-11-08 14:58:47,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 14:58:47,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:58:47,572 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:58:47,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 14:58:47,572 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:58:47,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:58:47,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2063489852, now seen corresponding path program 1 times [2024-11-08 14:58:47,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:58:47,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442344819] [2024-11-08 14:58:47,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:47,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:58:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:47,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:58:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:47,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:58:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:47,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:58:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:47,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:58:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:47,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:58:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:47,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:58:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:47,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 14:58:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:47,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 14:58:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:47,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 14:58:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:47,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 14:58:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:47,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 14:58:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:47,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 14:58:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:47,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:58:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 14:58:47,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:58:47,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442344819] [2024-11-08 14:58:47,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442344819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:58:47,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:58:47,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:58:47,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860591437] [2024-11-08 14:58:47,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:58:47,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:58:47,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:58:47,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:58:47,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:58:47,729 INFO L87 Difference]: Start difference. First operand 5834 states and 9802 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:49,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:58:49,165 INFO L93 Difference]: Finished difference Result 14496 states and 24832 transitions. [2024-11-08 14:58:49,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 14:58:49,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 134 [2024-11-08 14:58:49,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:58:49,199 INFO L225 Difference]: With dead ends: 14496 [2024-11-08 14:58:49,199 INFO L226 Difference]: Without dead ends: 9881 [2024-11-08 14:58:49,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 14:58:49,211 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1141 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:58:49,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 855 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 14:58:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9881 states. [2024-11-08 14:58:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9881 to 9712. [2024-11-08 14:58:49,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9712 states, 8120 states have (on average 1.5985221674876848) internal successors, (12980), 8127 states have internal predecessors, (12980), 1568 states have call successors, (1568), 19 states have call predecessors, (1568), 23 states have return successors, (1763), 1567 states have call predecessors, (1763), 1567 states have call successors, (1763) [2024-11-08 14:58:49,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9712 states to 9712 states and 16311 transitions. [2024-11-08 14:58:49,541 INFO L78 Accepts]: Start accepts. Automaton has 9712 states and 16311 transitions. Word has length 134 [2024-11-08 14:58:49,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:58:49,542 INFO L471 AbstractCegarLoop]: Abstraction has 9712 states and 16311 transitions. [2024-11-08 14:58:49,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 9712 states and 16311 transitions. [2024-11-08 14:58:49,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-08 14:58:49,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:58:49,564 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:58:49,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 14:58:49,565 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:58:49,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:58:49,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1986235149, now seen corresponding path program 1 times [2024-11-08 14:58:49,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:58:49,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171046094] [2024-11-08 14:58:49,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:49,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:58:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:49,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:58:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:49,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:58:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:49,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:58:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:49,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:58:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:49,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:58:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:49,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:58:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:49,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 14:58:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:49,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 14:58:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:49,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 14:58:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:49,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 14:58:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:49,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 14:58:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:49,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 14:58:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:49,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:58:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 14:58:49,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:58:49,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171046094] [2024-11-08 14:58:49,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171046094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:58:49,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:58:49,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:58:49,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343541574] [2024-11-08 14:58:49,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:58:49,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:58:49,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:58:49,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:58:49,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:58:49,669 INFO L87 Difference]: Start difference. First operand 9712 states and 16311 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:51,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:58:51,109 INFO L93 Difference]: Finished difference Result 25205 states and 43113 transitions. [2024-11-08 14:58:51,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 14:58:51,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 135 [2024-11-08 14:58:51,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:58:51,162 INFO L225 Difference]: With dead ends: 25205 [2024-11-08 14:58:51,163 INFO L226 Difference]: Without dead ends: 17194 [2024-11-08 14:58:51,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 14:58:51,186 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 1126 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:58:51,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 902 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 14:58:51,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17194 states. [2024-11-08 14:58:51,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17194 to 17025. [2024-11-08 14:58:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17025 states, 14230 states have (on average 1.5900210822206606) internal successors, (22626), 14237 states have internal predecessors, (22626), 2771 states have call successors, (2771), 19 states have call predecessors, (2771), 23 states have return successors, (3110), 2770 states have call predecessors, (3110), 2770 states have call successors, (3110) [2024-11-08 14:58:51,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17025 states to 17025 states and 28507 transitions. [2024-11-08 14:58:51,727 INFO L78 Accepts]: Start accepts. Automaton has 17025 states and 28507 transitions. Word has length 135 [2024-11-08 14:58:51,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:58:51,728 INFO L471 AbstractCegarLoop]: Abstraction has 17025 states and 28507 transitions. [2024-11-08 14:58:51,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:51,728 INFO L276 IsEmpty]: Start isEmpty. Operand 17025 states and 28507 transitions. [2024-11-08 14:58:51,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-08 14:58:51,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:58:51,755 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:58:51,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 14:58:51,755 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:58:51,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:58:51,755 INFO L85 PathProgramCache]: Analyzing trace with hash 776804229, now seen corresponding path program 1 times [2024-11-08 14:58:51,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:58:51,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468728878] [2024-11-08 14:58:51,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:51,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:58:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:51,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:58:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:51,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:58:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:51,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:58:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:51,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:58:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:51,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:58:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:51,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:58:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:51,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 14:58:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:51,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 14:58:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:51,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 14:58:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:51,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 14:58:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:51,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 14:58:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:51,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 14:58:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:51,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:58:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 14:58:51,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:58:51,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468728878] [2024-11-08 14:58:51,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468728878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:58:51,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:58:51,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:58:51,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567363062] [2024-11-08 14:58:51,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:58:51,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:58:51,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:58:51,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:58:51,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:58:51,857 INFO L87 Difference]: Start difference. First operand 17025 states and 28507 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:53,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:58:53,717 INFO L93 Difference]: Finished difference Result 45181 states and 77126 transitions. [2024-11-08 14:58:53,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 14:58:53,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 136 [2024-11-08 14:58:53,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:58:53,820 INFO L225 Difference]: With dead ends: 45181 [2024-11-08 14:58:53,820 INFO L226 Difference]: Without dead ends: 30534 [2024-11-08 14:58:53,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 14:58:53,862 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1140 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:58:53,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 854 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 14:58:53,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30534 states. [2024-11-08 14:58:54,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30534 to 30365. [2024-11-08 14:58:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30365 states, 25531 states have (on average 1.585875993889781) internal successors, (40489), 25538 states have internal predecessors, (40489), 4810 states have call successors, (4810), 19 states have call predecessors, (4810), 23 states have return successors, (5423), 4809 states have call predecessors, (5423), 4809 states have call successors, (5423) [2024-11-08 14:58:54,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30365 states to 30365 states and 50722 transitions. [2024-11-08 14:58:54,811 INFO L78 Accepts]: Start accepts. Automaton has 30365 states and 50722 transitions. Word has length 136 [2024-11-08 14:58:54,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:58:54,813 INFO L471 AbstractCegarLoop]: Abstraction has 30365 states and 50722 transitions. [2024-11-08 14:58:54,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:54,813 INFO L276 IsEmpty]: Start isEmpty. Operand 30365 states and 50722 transitions. [2024-11-08 14:58:54,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 14:58:54,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:58:54,838 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:58:54,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 14:58:54,838 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:58:54,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:58:54,839 INFO L85 PathProgramCache]: Analyzing trace with hash -24570257, now seen corresponding path program 1 times [2024-11-08 14:58:54,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:58:54,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998886314] [2024-11-08 14:58:54,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:54,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:58:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:54,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:58:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:54,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:58:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:54,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:58:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:54,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:58:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:54,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:58:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:54,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:58:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:54,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 14:58:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:54,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 14:58:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:54,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 14:58:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:54,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 14:58:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:54,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 14:58:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:54,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 14:58:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:54,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:58:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 14:58:54,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:58:54,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998886314] [2024-11-08 14:58:54,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998886314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:58:54,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:58:54,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:58:54,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478848091] [2024-11-08 14:58:54,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:58:54,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:58:54,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:58:54,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:58:54,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:58:54,932 INFO L87 Difference]: Start difference. First operand 30365 states and 50722 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:58:57,441 INFO L93 Difference]: Finished difference Result 82918 states and 140650 transitions. [2024-11-08 14:58:57,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 14:58:57,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 137 [2024-11-08 14:58:57,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:58:57,637 INFO L225 Difference]: With dead ends: 82918 [2024-11-08 14:58:57,638 INFO L226 Difference]: Without dead ends: 55743 [2024-11-08 14:58:57,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 14:58:57,720 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1087 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 1764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:58:57,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 855 Invalid, 1764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 1384 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 14:58:57,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55743 states. [2024-11-08 14:58:59,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55743 to 55574. [2024-11-08 14:58:59,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55574 states, 47025 states have (on average 1.5804359383306752) internal successors, (74320), 47032 states have internal predecessors, (74320), 8525 states have call successors, (8525), 19 states have call predecessors, (8525), 23 states have return successors, (9670), 8524 states have call predecessors, (9670), 8524 states have call successors, (9670) [2024-11-08 14:58:59,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55574 states to 55574 states and 92515 transitions. [2024-11-08 14:58:59,736 INFO L78 Accepts]: Start accepts. Automaton has 55574 states and 92515 transitions. Word has length 137 [2024-11-08 14:58:59,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:58:59,737 INFO L471 AbstractCegarLoop]: Abstraction has 55574 states and 92515 transitions. [2024-11-08 14:58:59,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:58:59,737 INFO L276 IsEmpty]: Start isEmpty. Operand 55574 states and 92515 transitions. [2024-11-08 14:58:59,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 14:58:59,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:58:59,779 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:58:59,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 14:58:59,779 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:58:59,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:58:59,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1455031077, now seen corresponding path program 1 times [2024-11-08 14:58:59,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:58:59,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872921924] [2024-11-08 14:58:59,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:58:59,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:58:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:59,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:58:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:59,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:58:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:59,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:58:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:59,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:58:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:59,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:58:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:59,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:58:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:59,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 14:58:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:59,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 14:58:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:59,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 14:58:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:59,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 14:58:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:59,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 14:58:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:59,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 14:58:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:59,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:58:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:58:59,898 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 14:58:59,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:58:59,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872921924] [2024-11-08 14:58:59,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872921924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:58:59,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:58:59,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:58:59,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887406269] [2024-11-08 14:58:59,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:58:59,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:58:59,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:58:59,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:58:59,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:58:59,901 INFO L87 Difference]: Start difference. First operand 55574 states and 92515 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:59:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:59:03,095 INFO L93 Difference]: Finished difference Result 103974 states and 176636 transitions. [2024-11-08 14:59:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 14:59:03,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 138 [2024-11-08 14:59:03,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:59:03,627 INFO L225 Difference]: With dead ends: 103974 [2024-11-08 14:59:03,627 INFO L226 Difference]: Without dead ends: 103817 [2024-11-08 14:59:03,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 14:59:03,659 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 1086 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 386 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1100 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 386 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:59:03,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1100 Valid, 894 Invalid, 1773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [386 Valid, 1387 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 14:59:03,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103817 states. [2024-11-08 14:59:06,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103817 to 103648. [2024-11-08 14:59:06,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103648 states, 88300 states have (on average 1.5736240090600226) internal successors, (138951), 88307 states have internal predecessors, (138951), 15324 states have call successors, (15324), 19 states have call predecessors, (15324), 23 states have return successors, (17515), 15323 states have call predecessors, (17515), 15323 states have call successors, (17515) [2024-11-08 14:59:07,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103648 states to 103648 states and 171790 transitions. [2024-11-08 14:59:07,205 INFO L78 Accepts]: Start accepts. Automaton has 103648 states and 171790 transitions. Word has length 138 [2024-11-08 14:59:07,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:59:07,206 INFO L471 AbstractCegarLoop]: Abstraction has 103648 states and 171790 transitions. [2024-11-08 14:59:07,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 14:59:07,206 INFO L276 IsEmpty]: Start isEmpty. Operand 103648 states and 171790 transitions. [2024-11-08 14:59:07,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 14:59:07,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:59:07,247 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:59:07,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 14:59:07,247 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:59:07,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:59:07,247 INFO L85 PathProgramCache]: Analyzing trace with hash -2128851154, now seen corresponding path program 1 times [2024-11-08 14:59:07,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:59:07,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980923221] [2024-11-08 14:59:07,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:59:07,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:59:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:07,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:59:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:07,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:59:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:07,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:59:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:07,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:59:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:07,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:59:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:07,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:59:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:07,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 14:59:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:07,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 14:59:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:07,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 14:59:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:07,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 14:59:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:07,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 14:59:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:07,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 14:59:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:07,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:59:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:07,515 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-08 14:59:07,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:59:07,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980923221] [2024-11-08 14:59:07,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980923221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:59:07,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952772443] [2024-11-08 14:59:07,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:59:07,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:59:07,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:59:07,518 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-08 14:59:07,518 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-08 14:59:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:07,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 14:59:07,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:59:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 14:59:08,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:59:08,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952772443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:59:08,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 14:59:08,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 26 [2024-11-08 14:59:08,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074169386] [2024-11-08 14:59:08,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:59:08,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 14:59:08,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:59:08,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 14:59:08,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2024-11-08 14:59:08,121 INFO L87 Difference]: Start difference. First operand 103648 states and 171790 transitions. Second operand has 12 states, 11 states have (on average 9.545454545454545) internal successors, (105), 9 states have internal predecessors, (105), 5 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-08 14:59:13,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:59:13,378 INFO L93 Difference]: Finished difference Result 206555 states and 347847 transitions. [2024-11-08 14:59:13,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 14:59:13,379 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 9.545454545454545) internal successors, (105), 9 states have internal predecessors, (105), 5 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 139 [2024-11-08 14:59:13,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:59:14,152 INFO L225 Difference]: With dead ends: 206555 [2024-11-08 14:59:14,153 INFO L226 Difference]: Without dead ends: 206404 [2024-11-08 14:59:14,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=1164, Unknown=0, NotChecked=0, Total=1332 [2024-11-08 14:59:14,230 INFO L432 NwaCegarLoop]: 579 mSDtfsCounter, 1240 mSDsluCounter, 3611 mSDsCounter, 0 mSdLazyCounter, 1107 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 4190 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:59:14,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 4190 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1107 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 14:59:14,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206404 states. [2024-11-08 14:59:21,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206404 to 206376. [2024-11-08 14:59:21,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206376 states, 175878 states have (on average 1.574443648438122) internal successors, (276910), 175780 states have internal predecessors, (276910), 30441 states have call successors, (30441), 50 states have call predecessors, (30441), 56 states have return successors, (38097), 30551 states have call predecessors, (38097), 30438 states have call successors, (38097) [2024-11-08 14:59:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206376 states to 206376 states and 345448 transitions. [2024-11-08 14:59:22,990 INFO L78 Accepts]: Start accepts. Automaton has 206376 states and 345448 transitions. Word has length 139 [2024-11-08 14:59:22,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:59:22,991 INFO L471 AbstractCegarLoop]: Abstraction has 206376 states and 345448 transitions. [2024-11-08 14:59:22,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 9.545454545454545) internal successors, (105), 9 states have internal predecessors, (105), 5 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-08 14:59:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 206376 states and 345448 transitions. [2024-11-08 14:59:23,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 14:59:23,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:59:23,180 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:59:23,212 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-08 14:59:23,384 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-08 14:59:23,385 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:59:23,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:59:23,385 INFO L85 PathProgramCache]: Analyzing trace with hash 809324387, now seen corresponding path program 1 times [2024-11-08 14:59:23,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:59:23,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211549683] [2024-11-08 14:59:23,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:59:23,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:59:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:23,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 14:59:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:23,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:59:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:23,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:59:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:23,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 14:59:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:23,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:59:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:23,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:59:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:23,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 14:59:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:23,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 14:59:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:23,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 14:59:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:23,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 14:59:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:23,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 14:59:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:23,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 14:59:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:23,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 14:59:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:59:23,665 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-08 14:59:23,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:59:23,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211549683] [2024-11-08 14:59:23,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211549683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:59:23,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:59:23,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 14:59:23,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557146766] [2024-11-08 14:59:23,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:59:23,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 14:59:23,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:59:23,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 14:59:23,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-08 14:59:23,667 INFO L87 Difference]: Start difference. First operand 206376 states and 345448 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (15), 7 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13)