./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product16.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product16.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 47500ba035fb95802358be3af8dbcb0499051de1fc18562b910c6b7689271057 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 00:57:08,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 00:57:08,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 00:57:08,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 00:57:08,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 00:57:08,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 00:57:08,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 00:57:08,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 00:57:08,905 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 00:57:08,906 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 00:57:08,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 00:57:08,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 00:57:08,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 00:57:08,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 00:57:08,908 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 00:57:08,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 00:57:08,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 00:57:08,909 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 00:57:08,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 00:57:08,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 00:57:08,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 00:57:08,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 00:57:08,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 00:57:08,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 00:57:08,911 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 00:57:08,911 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 00:57:08,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 00:57:08,912 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 00:57:08,912 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 00:57:08,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 00:57:08,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 00:57:08,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 00:57:08,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:57:08,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 00:57:08,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 00:57:08,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 00:57:08,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 00:57:08,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 00:57:08,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 00:57:08,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 00:57:08,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 00:57:08,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 00:57:08,916 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 -> 47500ba035fb95802358be3af8dbcb0499051de1fc18562b910c6b7689271057 [2024-10-24 00:57:09,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 00:57:09,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 00:57:09,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 00:57:09,199 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 00:57:09,199 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 00:57:09,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product16.cil.c [2024-10-24 00:57:10,586 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 00:57:10,910 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 00:57:10,910 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product16.cil.c [2024-10-24 00:57:10,932 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/265451aff/de7476c7ff5e4bc5be5a483302b618fa/FLAGe75a547e3 [2024-10-24 00:57:11,166 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/265451aff/de7476c7ff5e4bc5be5a483302b618fa [2024-10-24 00:57:11,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 00:57:11,170 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 00:57:11,172 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 00:57:11,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 00:57:11,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 00:57:11,177 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:57:11" (1/1) ... [2024-10-24 00:57:11,178 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fcc0c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:11, skipping insertion in model container [2024-10-24 00:57:11,178 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:57:11" (1/1) ... [2024-10-24 00:57:11,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 00:57:11,740 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product16.cil.c[33283,33296] [2024-10-24 00:57:11,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:57:11,856 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 00:57:11,866 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [48] [2024-10-24 00:57:11,868 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [105] [2024-10-24 00:57:11,868 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [216] [2024-10-24 00:57:11,868 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [233] [2024-10-24 00:57:11,869 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [599] [2024-10-24 00:57:11,869 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1004] [2024-10-24 00:57:11,869 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1278] [2024-10-24 00:57:11,869 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1316] [2024-10-24 00:57:11,870 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1541] [2024-10-24 00:57:11,870 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1550] [2024-10-24 00:57:11,871 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1832] [2024-10-24 00:57:11,936 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product16.cil.c[33283,33296] [2024-10-24 00:57:11,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:57:12,010 INFO L204 MainTranslator]: Completed translation [2024-10-24 00:57:12,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:12 WrapperNode [2024-10-24 00:57:12,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 00:57:12,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 00:57:12,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 00:57:12,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 00:57:12,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:12" (1/1) ... [2024-10-24 00:57:12,046 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:12" (1/1) ... [2024-10-24 00:57:12,098 INFO L138 Inliner]: procedures = 126, calls = 185, calls flagged for inlining = 57, calls inlined = 52, statements flattened = 1003 [2024-10-24 00:57:12,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 00:57:12,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 00:57:12,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 00:57:12,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 00:57:12,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:12" (1/1) ... [2024-10-24 00:57:12,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:12" (1/1) ... [2024-10-24 00:57:12,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:12" (1/1) ... [2024-10-24 00:57:12,154 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-10-24 00:57:12,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:12" (1/1) ... [2024-10-24 00:57:12,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:12" (1/1) ... [2024-10-24 00:57:12,183 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:12" (1/1) ... [2024-10-24 00:57:12,201 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:12" (1/1) ... [2024-10-24 00:57:12,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:12" (1/1) ... [2024-10-24 00:57:12,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:12" (1/1) ... [2024-10-24 00:57:12,230 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 00:57:12,231 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 00:57:12,231 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 00:57:12,231 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 00:57:12,232 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:12" (1/1) ... [2024-10-24 00:57:12,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:57:12,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:57:12,266 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 00:57:12,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 00:57:12,314 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-10-24 00:57:12,314 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-10-24 00:57:12,314 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-10-24 00:57:12,314 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-10-24 00:57:12,314 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-24 00:57:12,314 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-24 00:57:12,314 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-24 00:57:12,315 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-24 00:57:12,315 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-24 00:57:12,315 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-24 00:57:12,315 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-10-24 00:57:12,315 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-10-24 00:57:12,315 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-24 00:57:12,315 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-24 00:57:12,315 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-24 00:57:12,316 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-24 00:57:12,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 00:57:12,316 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-24 00:57:12,316 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-24 00:57:12,316 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-24 00:57:12,316 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-24 00:57:12,316 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-24 00:57:12,316 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-24 00:57:12,316 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-24 00:57:12,316 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-24 00:57:12,317 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-10-24 00:57:12,317 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-10-24 00:57:12,317 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-24 00:57:12,317 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-24 00:57:12,317 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-24 00:57:12,317 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-24 00:57:12,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 00:57:12,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 00:57:12,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 00:57:12,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 00:57:12,318 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-24 00:57:12,318 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-24 00:57:12,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 00:57:12,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 00:57:12,504 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 00:57:12,506 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 00:57:13,368 INFO L? ?]: Removed 417 outVars from TransFormulas that were not future-live. [2024-10-24 00:57:13,368 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 00:57:13,436 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 00:57:13,436 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 00:57:13,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:57:13 BoogieIcfgContainer [2024-10-24 00:57:13,437 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 00:57:13,442 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 00:57:13,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 00:57:13,446 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 00:57:13,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:57:11" (1/3) ... [2024-10-24 00:57:13,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6b9b8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:57:13, skipping insertion in model container [2024-10-24 00:57:13,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:12" (2/3) ... [2024-10-24 00:57:13,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6b9b8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:57:13, skipping insertion in model container [2024-10-24 00:57:13,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:57:13" (3/3) ... [2024-10-24 00:57:13,449 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec9_product16.cil.c [2024-10-24 00:57:13,464 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 00:57:13,465 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 00:57:13,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 00:57:13,555 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;@61a1433d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 00:57:13,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 00:57:13,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 271 states, 208 states have (on average 1.6057692307692308) internal successors, (334), 212 states have internal predecessors, (334), 45 states have call successors, (45), 16 states have call predecessors, (45), 16 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 00:57:13,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 00:57:13,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:13,586 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:13,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:13,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:13,593 INFO L85 PathProgramCache]: Analyzing trace with hash 453579907, now seen corresponding path program 1 times [2024-10-24 00:57:13,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:13,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010401834] [2024-10-24 00:57:13,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:13,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:57:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:57:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:57:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 00:57:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 00:57:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:57:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:57:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:57:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:57:14,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:14,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010401834] [2024-10-24 00:57:14,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010401834] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:57:14,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747677621] [2024-10-24 00:57:14,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:14,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:14,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:57:14,364 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:57:14,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 00:57:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 00:57:14,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:57:14,733 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:57:14,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:57:14,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747677621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:14,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:57:14,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-24 00:57:14,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378353604] [2024-10-24 00:57:14,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:14,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 00:57:14,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:14,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 00:57:14,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:57:14,772 INFO L87 Difference]: Start difference. First operand has 271 states, 208 states have (on average 1.6057692307692308) internal successors, (334), 212 states have internal predecessors, (334), 45 states have call successors, (45), 16 states have call predecessors, (45), 16 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:14,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:14,853 INFO L93 Difference]: Finished difference Result 397 states and 611 transitions. [2024-10-24 00:57:14,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 00:57:14,856 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 83 [2024-10-24 00:57:14,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:14,877 INFO L225 Difference]: With dead ends: 397 [2024-10-24 00:57:14,877 INFO L226 Difference]: Without dead ends: 268 [2024-10-24 00:57:14,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:57:14,885 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:14,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 405 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:57:14,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-24 00:57:14,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-10-24 00:57:14,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 206 states have (on average 1.587378640776699) internal successors, (327), 209 states have internal predecessors, (327), 45 states have call successors, (45), 16 states have call predecessors, (45), 16 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 00:57:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 416 transitions. [2024-10-24 00:57:14,950 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 416 transitions. Word has length 83 [2024-10-24 00:57:14,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:14,951 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 416 transitions. [2024-10-24 00:57:14,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:14,952 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 416 transitions. [2024-10-24 00:57:14,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 00:57:14,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:14,956 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:14,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 00:57:15,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-24 00:57:15,157 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:15,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:15,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1848905278, now seen corresponding path program 1 times [2024-10-24 00:57:15,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:15,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077079928] [2024-10-24 00:57:15,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:15,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:57:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:57:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:57:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:57:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 00:57:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:57:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:57:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:57:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,502 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:57:15,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:15,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077079928] [2024-10-24 00:57:15,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077079928] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:57:15,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980048752] [2024-10-24 00:57:15,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:15,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:15,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:57:15,505 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:57:15,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 00:57:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 00:57:15,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:57:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:57:15,819 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:57:15,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980048752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:15,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:57:15,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 00:57:15,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66876517] [2024-10-24 00:57:15,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:15,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:57:15,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:15,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:57:15,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:57:15,826 INFO L87 Difference]: Start difference. First operand 268 states and 416 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:15,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:15,904 INFO L93 Difference]: Finished difference Result 393 states and 598 transitions. [2024-10-24 00:57:15,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:57:15,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 84 [2024-10-24 00:57:15,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:15,908 INFO L225 Difference]: With dead ends: 393 [2024-10-24 00:57:15,908 INFO L226 Difference]: Without dead ends: 270 [2024-10-24 00:57:15,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:57:15,910 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 0 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:15,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 803 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:57:15,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-24 00:57:15,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2024-10-24 00:57:15,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 208 states have (on average 1.5817307692307692) internal successors, (329), 211 states have internal predecessors, (329), 45 states have call successors, (45), 16 states have call predecessors, (45), 16 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 00:57:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 418 transitions. [2024-10-24 00:57:15,931 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 418 transitions. Word has length 84 [2024-10-24 00:57:15,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:15,932 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 418 transitions. [2024-10-24 00:57:15,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:15,932 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 418 transitions. [2024-10-24 00:57:15,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-24 00:57:15,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:15,935 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:15,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 00:57:16,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-24 00:57:16,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:16,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:16,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1526686467, now seen corresponding path program 1 times [2024-10-24 00:57:16,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:16,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459820228] [2024-10-24 00:57:16,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:16,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:57:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:57:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:57:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 00:57:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:57:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:57:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:57:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:57:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,384 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:57:16,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:16,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459820228] [2024-10-24 00:57:16,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459820228] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:57:16,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892091149] [2024-10-24 00:57:16,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:16,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:16,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:57:16,388 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:57:16,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 00:57:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:57:16,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:57:16,696 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:57:16,697 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:57:16,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892091149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:16,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:57:16,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 00:57:16,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058781273] [2024-10-24 00:57:16,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:16,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:57:16,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:16,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:57:16,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:57:16,704 INFO L87 Difference]: Start difference. First operand 270 states and 418 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:16,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:16,769 INFO L93 Difference]: Finished difference Result 570 states and 895 transitions. [2024-10-24 00:57:16,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:57:16,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2024-10-24 00:57:16,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:16,775 INFO L225 Difference]: With dead ends: 570 [2024-10-24 00:57:16,775 INFO L226 Difference]: Without dead ends: 322 [2024-10-24 00:57:16,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:57:16,779 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 102 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:16,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 774 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:57:16,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-24 00:57:16,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 317. [2024-10-24 00:57:16,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 244 states have (on average 1.5942622950819672) internal successors, (389), 247 states have internal predecessors, (389), 56 states have call successors, (56), 16 states have call predecessors, (56), 16 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-24 00:57:16,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 500 transitions. [2024-10-24 00:57:16,817 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 500 transitions. Word has length 89 [2024-10-24 00:57:16,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:16,818 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 500 transitions. [2024-10-24 00:57:16,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:16,818 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 500 transitions. [2024-10-24 00:57:16,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-24 00:57:16,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:16,821 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:16,843 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-10-24 00:57:17,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:17,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:17,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:17,023 INFO L85 PathProgramCache]: Analyzing trace with hash 860040952, now seen corresponding path program 1 times [2024-10-24 00:57:17,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:17,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278641570] [2024-10-24 00:57:17,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:17,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:17,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:17,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:17,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:17,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:57:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:17,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:57:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:17,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:57:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:17,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 00:57:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:17,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:57:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:17,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:57:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:17,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:57:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:17,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:57:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:57:17,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:17,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278641570] [2024-10-24 00:57:17,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278641570] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:57:17,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537282300] [2024-10-24 00:57:17,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:17,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:17,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:57:17,247 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:57:17,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 00:57:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:17,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 00:57:17,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:57:17,575 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 00:57:17,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:57:17,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537282300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:17,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:57:17,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-24 00:57:17,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358621166] [2024-10-24 00:57:17,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:17,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:57:17,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:17,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:57:17,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:57:17,577 INFO L87 Difference]: Start difference. First operand 317 states and 500 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:57:17,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:17,691 INFO L93 Difference]: Finished difference Result 629 states and 994 transitions. [2024-10-24 00:57:17,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:57:17,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2024-10-24 00:57:17,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:17,696 INFO L225 Difference]: With dead ends: 629 [2024-10-24 00:57:17,696 INFO L226 Difference]: Without dead ends: 319 [2024-10-24 00:57:17,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:57:17,701 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 2 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:17,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1565 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:57:17,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-24 00:57:17,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2024-10-24 00:57:17,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 245 states have (on average 1.5918367346938775) internal successors, (390), 249 states have internal predecessors, (390), 56 states have call successors, (56), 16 states have call predecessors, (56), 17 states have return successors, (57), 55 states have call predecessors, (57), 55 states have call successors, (57) [2024-10-24 00:57:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 503 transitions. [2024-10-24 00:57:17,725 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 503 transitions. Word has length 90 [2024-10-24 00:57:17,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:17,726 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 503 transitions. [2024-10-24 00:57:17,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:57:17,726 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 503 transitions. [2024-10-24 00:57:17,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 00:57:17,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:17,730 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:17,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 00:57:17,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:17,931 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:17,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:17,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1027149010, now seen corresponding path program 1 times [2024-10-24 00:57:17,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:17,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755851716] [2024-10-24 00:57:17,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:17,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 00:57:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 00:57:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 00:57:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:57:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:57:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:57:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:57:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,203 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:57:18,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:18,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755851716] [2024-10-24 00:57:18,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755851716] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:57:18,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575041293] [2024-10-24 00:57:18,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:18,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:18,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:57:18,206 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:57:18,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 00:57:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 00:57:18,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:57:18,529 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 00:57:18,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:57:18,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575041293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:18,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:57:18,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-24 00:57:18,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771078859] [2024-10-24 00:57:18,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:18,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:57:18,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:18,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:57:18,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:57:18,532 INFO L87 Difference]: Start difference. First operand 319 states and 503 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:57:18,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:18,642 INFO L93 Difference]: Finished difference Result 631 states and 999 transitions. [2024-10-24 00:57:18,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:57:18,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 91 [2024-10-24 00:57:18,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:18,645 INFO L225 Difference]: With dead ends: 631 [2024-10-24 00:57:18,645 INFO L226 Difference]: Without dead ends: 321 [2024-10-24 00:57:18,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:57:18,647 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 2 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:18,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1551 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:57:18,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-24 00:57:18,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2024-10-24 00:57:18,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 246 states have (on average 1.589430894308943) internal successors, (391), 251 states have internal predecessors, (391), 56 states have call successors, (56), 16 states have call predecessors, (56), 18 states have return successors, (62), 55 states have call predecessors, (62), 55 states have call successors, (62) [2024-10-24 00:57:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 509 transitions. [2024-10-24 00:57:18,666 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 509 transitions. Word has length 91 [2024-10-24 00:57:18,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:18,667 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 509 transitions. [2024-10-24 00:57:18,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:57:18,667 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 509 transitions. [2024-10-24 00:57:18,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 00:57:18,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:18,669 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:18,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 00:57:18,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:18,871 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:18,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:18,872 INFO L85 PathProgramCache]: Analyzing trace with hash -45708592, now seen corresponding path program 1 times [2024-10-24 00:57:18,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:18,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10164926] [2024-10-24 00:57:18,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:18,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:19,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:19,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:19,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:19,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:19,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 00:57:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:19,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 00:57:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:19,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:57:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:19,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:57:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:19,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:57:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:19,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:57:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:57:19,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:19,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10164926] [2024-10-24 00:57:19,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10164926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:19,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:19,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:57:19,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704677481] [2024-10-24 00:57:19,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:19,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:57:19,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:19,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:57:19,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:57:19,084 INFO L87 Difference]: Start difference. First operand 321 states and 509 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:57:20,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:20,962 INFO L93 Difference]: Finished difference Result 738 states and 1180 transitions. [2024-10-24 00:57:20,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:57:20,963 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 92 [2024-10-24 00:57:20,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:20,984 INFO L225 Difference]: With dead ends: 738 [2024-10-24 00:57:20,984 INFO L226 Difference]: Without dead ends: 436 [2024-10-24 00:57:20,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:57:20,988 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 850 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 2431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:20,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 968 Invalid, 2431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 2161 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 00:57:20,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-10-24 00:57:21,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 321. [2024-10-24 00:57:21,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 246 states have (on average 1.589430894308943) internal successors, (391), 251 states have internal predecessors, (391), 56 states have call successors, (56), 16 states have call predecessors, (56), 18 states have return successors, (61), 55 states have call predecessors, (61), 55 states have call successors, (61) [2024-10-24 00:57:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 508 transitions. [2024-10-24 00:57:21,018 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 508 transitions. Word has length 92 [2024-10-24 00:57:21,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:21,018 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 508 transitions. [2024-10-24 00:57:21,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:57:21,019 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 508 transitions. [2024-10-24 00:57:21,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 00:57:21,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:21,020 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:21,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 00:57:21,021 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:21,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:21,021 INFO L85 PathProgramCache]: Analyzing trace with hash 136611688, now seen corresponding path program 2 times [2024-10-24 00:57:21,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:21,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665932969] [2024-10-24 00:57:21,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:21,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 00:57:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 00:57:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 00:57:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:57:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:57:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:57:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:57:21,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:21,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665932969] [2024-10-24 00:57:21,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665932969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:21,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:21,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:57:21,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151315395] [2024-10-24 00:57:21,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:21,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:57:21,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:21,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:57:21,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:57:21,224 INFO L87 Difference]: Start difference. First operand 321 states and 508 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:57:22,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:22,833 INFO L93 Difference]: Finished difference Result 740 states and 1183 transitions. [2024-10-24 00:57:22,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:57:22,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 93 [2024-10-24 00:57:22,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:22,839 INFO L225 Difference]: With dead ends: 740 [2024-10-24 00:57:22,839 INFO L226 Difference]: Without dead ends: 438 [2024-10-24 00:57:22,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:57:22,841 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 846 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2178 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 2448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:22,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 968 Invalid, 2448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 2178 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 00:57:22,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-24 00:57:22,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 323. [2024-10-24 00:57:22,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 247 states have (on average 1.5870445344129556) internal successors, (392), 253 states have internal predecessors, (392), 56 states have call successors, (56), 16 states have call predecessors, (56), 19 states have return successors, (63), 55 states have call predecessors, (63), 55 states have call successors, (63) [2024-10-24 00:57:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 511 transitions. [2024-10-24 00:57:22,874 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 511 transitions. Word has length 93 [2024-10-24 00:57:22,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:22,874 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 511 transitions. [2024-10-24 00:57:22,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:57:22,875 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 511 transitions. [2024-10-24 00:57:22,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 00:57:22,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:22,876 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:22,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 00:57:22,877 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:22,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:22,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1044270059, now seen corresponding path program 1 times [2024-10-24 00:57:22,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:22,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700689326] [2024-10-24 00:57:22,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:22,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:23,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:23,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:23,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:23,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:23,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:23,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:23,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:57:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:23,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 00:57:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:23,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:57:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:23,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:57:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:23,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:57:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:23,114 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:57:23,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:23,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700689326] [2024-10-24 00:57:23,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700689326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:23,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:23,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:57:23,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121770207] [2024-10-24 00:57:23,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:23,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:57:23,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:23,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:57:23,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:57:23,118 INFO L87 Difference]: Start difference. First operand 323 states and 511 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-24 00:57:25,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:25,395 INFO L93 Difference]: Finished difference Result 738 states and 1178 transitions. [2024-10-24 00:57:25,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:57:25,395 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 94 [2024-10-24 00:57:25,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:25,399 INFO L225 Difference]: With dead ends: 738 [2024-10-24 00:57:25,399 INFO L226 Difference]: Without dead ends: 438 [2024-10-24 00:57:25,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-24 00:57:25,403 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 850 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 3586 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 3862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 3586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:25,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 1343 Invalid, 3862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 3586 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 00:57:25,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-24 00:57:25,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 323. [2024-10-24 00:57:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 247 states have (on average 1.5870445344129556) internal successors, (392), 253 states have internal predecessors, (392), 56 states have call successors, (56), 16 states have call predecessors, (56), 19 states have return successors, (62), 55 states have call predecessors, (62), 55 states have call successors, (62) [2024-10-24 00:57:25,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 510 transitions. [2024-10-24 00:57:25,451 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 510 transitions. Word has length 94 [2024-10-24 00:57:25,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:25,452 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 510 transitions. [2024-10-24 00:57:25,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-24 00:57:25,452 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 510 transitions. [2024-10-24 00:57:25,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 00:57:25,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:25,454 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:25,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 00:57:25,455 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:25,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:25,455 INFO L85 PathProgramCache]: Analyzing trace with hash -218970743, now seen corresponding path program 2 times [2024-10-24 00:57:25,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:25,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116820181] [2024-10-24 00:57:25,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:25,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:57:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 00:57:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:57:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:57:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:57:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:57:25,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:25,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116820181] [2024-10-24 00:57:25,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116820181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:25,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:25,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:57:25,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228055199] [2024-10-24 00:57:25,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:25,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:57:25,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:25,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:57:25,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:57:25,691 INFO L87 Difference]: Start difference. First operand 323 states and 510 transitions. Second operand has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-24 00:57:27,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:27,906 INFO L93 Difference]: Finished difference Result 740 states and 1184 transitions. [2024-10-24 00:57:27,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:57:27,906 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 95 [2024-10-24 00:57:27,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:27,909 INFO L225 Difference]: With dead ends: 740 [2024-10-24 00:57:27,909 INFO L226 Difference]: Without dead ends: 440 [2024-10-24 00:57:27,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-24 00:57:27,912 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 846 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 3622 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 3895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 3622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:27,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1344 Invalid, 3895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 3622 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 00:57:27,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-24 00:57:27,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 325. [2024-10-24 00:57:27,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 248 states have (on average 1.5846774193548387) internal successors, (393), 255 states have internal predecessors, (393), 56 states have call successors, (56), 16 states have call predecessors, (56), 20 states have return successors, (67), 55 states have call predecessors, (67), 55 states have call successors, (67) [2024-10-24 00:57:27,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 516 transitions. [2024-10-24 00:57:27,938 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 516 transitions. Word has length 95 [2024-10-24 00:57:27,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:27,938 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 516 transitions. [2024-10-24 00:57:27,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-24 00:57:27,938 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 516 transitions. [2024-10-24 00:57:27,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 00:57:27,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:27,940 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:27,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 00:57:27,940 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:27,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:27,941 INFO L85 PathProgramCache]: Analyzing trace with hash -623043066, now seen corresponding path program 1 times [2024-10-24 00:57:27,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:27,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924247872] [2024-10-24 00:57:27,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:27,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:28,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:28,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:28,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:28,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:28,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:28,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:28,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:57:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:28,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 00:57:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:28,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:57:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:28,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:57:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:28,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:57:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:28,065 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:28,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:28,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924247872] [2024-10-24 00:57:28,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924247872] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:57:28,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523470347] [2024-10-24 00:57:28,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:28,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:28,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:57:28,068 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:57:28,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 00:57:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:28,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:57:28,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:57:28,339 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:28,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:57:28,423 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:28,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523470347] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:57:28,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:57:28,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-10-24 00:57:28,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720844310] [2024-10-24 00:57:28,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:57:28,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 00:57:28,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:28,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 00:57:28,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:57:28,428 INFO L87 Difference]: Start difference. First operand 325 states and 516 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 00:57:30,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:30,097 INFO L93 Difference]: Finished difference Result 893 states and 1496 transitions. [2024-10-24 00:57:30,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 00:57:30,097 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 96 [2024-10-24 00:57:30,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:30,103 INFO L225 Difference]: With dead ends: 893 [2024-10-24 00:57:30,103 INFO L226 Difference]: Without dead ends: 770 [2024-10-24 00:57:30,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:57:30,105 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 1145 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:30,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 1405 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 00:57:30,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-10-24 00:57:30,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 640. [2024-10-24 00:57:30,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 499 states have (on average 1.6392785571142285) internal successors, (818), 506 states have internal predecessors, (818), 120 states have call successors, (120), 16 states have call predecessors, (120), 20 states have return successors, (141), 119 states have call predecessors, (141), 119 states have call successors, (141) [2024-10-24 00:57:30,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1079 transitions. [2024-10-24 00:57:30,144 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1079 transitions. Word has length 96 [2024-10-24 00:57:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:30,145 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 1079 transitions. [2024-10-24 00:57:30,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 00:57:30,146 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1079 transitions. [2024-10-24 00:57:30,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 00:57:30,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:30,150 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:30,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 00:57:30,350 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-10-24 00:57:30,351 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:30,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:30,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1829812663, now seen corresponding path program 1 times [2024-10-24 00:57:30,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:30,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928164823] [2024-10-24 00:57:30,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:30,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:30,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:30,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:30,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:30,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:30,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:30,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:30,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:57:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:30,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:57:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:30,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:57:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:30,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:57:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:30,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:57:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:30,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:30,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928164823] [2024-10-24 00:57:30,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928164823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:30,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:30,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:57:30,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610074266] [2024-10-24 00:57:30,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:30,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:57:30,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:30,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:57:30,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:57:30,481 INFO L87 Difference]: Start difference. First operand 640 states and 1079 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:31,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:31,550 INFO L93 Difference]: Finished difference Result 1652 states and 2845 transitions. [2024-10-24 00:57:31,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:57:31,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2024-10-24 00:57:31,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:31,562 INFO L225 Difference]: With dead ends: 1652 [2024-10-24 00:57:31,562 INFO L226 Difference]: Without dead ends: 1072 [2024-10-24 00:57:31,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:57:31,566 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 945 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 960 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 1597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:31,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [960 Valid, 740 Invalid, 1597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:57:31,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-10-24 00:57:31,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 952. [2024-10-24 00:57:31,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 747 states have (on average 1.6465863453815262) internal successors, (1230), 754 states have internal predecessors, (1230), 184 states have call successors, (184), 16 states have call predecessors, (184), 20 states have return successors, (215), 183 states have call predecessors, (215), 183 states have call successors, (215) [2024-10-24 00:57:31,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1629 transitions. [2024-10-24 00:57:31,619 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1629 transitions. Word has length 102 [2024-10-24 00:57:31,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:31,619 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1629 transitions. [2024-10-24 00:57:31,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:31,619 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1629 transitions. [2024-10-24 00:57:31,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 00:57:31,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:31,624 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:31,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 00:57:31,625 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:31,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:31,625 INFO L85 PathProgramCache]: Analyzing trace with hash 477458031, now seen corresponding path program 1 times [2024-10-24 00:57:31,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:31,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790680043] [2024-10-24 00:57:31,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:31,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:57:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:57:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:57:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:57:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:57:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:31,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:31,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790680043] [2024-10-24 00:57:31,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790680043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:31,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:31,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:57:31,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33501321] [2024-10-24 00:57:31,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:31,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:57:31,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:31,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:57:31,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:57:31,758 INFO L87 Difference]: Start difference. First operand 952 states and 1629 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:33,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:33,031 INFO L93 Difference]: Finished difference Result 2401 states and 4163 transitions. [2024-10-24 00:57:33,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:57:33,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-10-24 00:57:33,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:33,041 INFO L225 Difference]: With dead ends: 2401 [2024-10-24 00:57:33,042 INFO L226 Difference]: Without dead ends: 1559 [2024-10-24 00:57:33,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:57:33,047 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 943 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:33,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 710 Invalid, 1568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 00:57:33,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2024-10-24 00:57:33,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1439. [2024-10-24 00:57:33,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1139 states have (on average 1.6505706760316066) internal successors, (1880), 1146 states have internal predecessors, (1880), 279 states have call successors, (279), 16 states have call predecessors, (279), 20 states have return successors, (310), 278 states have call predecessors, (310), 278 states have call successors, (310) [2024-10-24 00:57:33,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2469 transitions. [2024-10-24 00:57:33,140 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2469 transitions. Word has length 103 [2024-10-24 00:57:33,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:33,141 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 2469 transitions. [2024-10-24 00:57:33,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:33,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2469 transitions. [2024-10-24 00:57:33,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 00:57:33,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:33,148 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:33,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 00:57:33,148 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:33,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:33,149 INFO L85 PathProgramCache]: Analyzing trace with hash 493311719, now seen corresponding path program 1 times [2024-10-24 00:57:33,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:33,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442877130] [2024-10-24 00:57:33,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:33,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:33,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:33,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:33,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:33,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:33,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:33,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:33,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:57:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:33,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:57:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:33,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:57:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:33,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:57:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:33,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:57:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:33,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:33,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442877130] [2024-10-24 00:57:33,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442877130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:33,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:33,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:57:33,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654475071] [2024-10-24 00:57:33,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:33,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:57:33,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:33,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:57:33,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:57:33,269 INFO L87 Difference]: Start difference. First operand 1439 states and 2469 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:34,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:34,456 INFO L93 Difference]: Finished difference Result 3503 states and 6122 transitions. [2024-10-24 00:57:34,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:57:34,456 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-10-24 00:57:34,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:34,469 INFO L225 Difference]: With dead ends: 3503 [2024-10-24 00:57:34,469 INFO L226 Difference]: Without dead ends: 2294 [2024-10-24 00:57:34,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:57:34,474 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 941 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:34,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 708 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:57:34,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2294 states. [2024-10-24 00:57:34,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2294 to 2174. [2024-10-24 00:57:34,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2174 states, 1751 states have (on average 1.6544831524842947) internal successors, (2897), 1758 states have internal predecessors, (2897), 402 states have call successors, (402), 16 states have call predecessors, (402), 20 states have return successors, (449), 401 states have call predecessors, (449), 401 states have call successors, (449) [2024-10-24 00:57:34,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 3748 transitions. [2024-10-24 00:57:34,570 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 3748 transitions. Word has length 104 [2024-10-24 00:57:34,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:34,571 INFO L471 AbstractCegarLoop]: Abstraction has 2174 states and 3748 transitions. [2024-10-24 00:57:34,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:34,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 3748 transitions. [2024-10-24 00:57:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 00:57:34,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:34,580 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:34,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 00:57:34,580 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:34,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:34,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1393428050, now seen corresponding path program 1 times [2024-10-24 00:57:34,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:34,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525186335] [2024-10-24 00:57:34,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:34,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:34,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:34,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:34,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:34,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:34,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:34,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:34,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:57:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:34,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:57:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:34,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:57:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:34,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:57:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:34,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:57:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:34,692 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:34,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:34,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525186335] [2024-10-24 00:57:34,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525186335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:34,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:34,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:57:34,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204990960] [2024-10-24 00:57:34,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:34,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:57:34,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:34,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:57:34,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:57:34,694 INFO L87 Difference]: Start difference. First operand 2174 states and 3748 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:35,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:35,822 INFO L93 Difference]: Finished difference Result 5213 states and 9172 transitions. [2024-10-24 00:57:35,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:57:35,822 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2024-10-24 00:57:35,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:35,842 INFO L225 Difference]: With dead ends: 5213 [2024-10-24 00:57:35,842 INFO L226 Difference]: Without dead ends: 3466 [2024-10-24 00:57:35,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:57:35,850 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 939 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:35,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 708 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:57:35,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3466 states. [2024-10-24 00:57:35,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3466 to 3346. [2024-10-24 00:57:35,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3346 states, 2744 states have (on average 1.657069970845481) internal successors, (4547), 2751 states have internal predecessors, (4547), 581 states have call successors, (581), 16 states have call predecessors, (581), 20 states have return successors, (654), 580 states have call predecessors, (654), 580 states have call successors, (654) [2024-10-24 00:57:35,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3346 states to 3346 states and 5782 transitions. [2024-10-24 00:57:36,000 INFO L78 Accepts]: Start accepts. Automaton has 3346 states and 5782 transitions. Word has length 105 [2024-10-24 00:57:36,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:36,000 INFO L471 AbstractCegarLoop]: Abstraction has 3346 states and 5782 transitions. [2024-10-24 00:57:36,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:36,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3346 states and 5782 transitions. [2024-10-24 00:57:36,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 00:57:36,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:36,010 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:36,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 00:57:36,010 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:36,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:36,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1044137003, now seen corresponding path program 1 times [2024-10-24 00:57:36,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:36,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938653949] [2024-10-24 00:57:36,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:36,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:36,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:36,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:36,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:36,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:36,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:36,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:36,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:57:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:36,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:57:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:36,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:57:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:36,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:57:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:36,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:57:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:36,109 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:36,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:36,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938653949] [2024-10-24 00:57:36,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938653949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:36,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:36,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:57:36,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544864788] [2024-10-24 00:57:36,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:36,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:57:36,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:36,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:57:36,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:57:36,112 INFO L87 Difference]: Start difference. First operand 3346 states and 5782 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:37,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:37,343 INFO L93 Difference]: Finished difference Result 8068 states and 14226 transitions. [2024-10-24 00:57:37,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:57:37,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2024-10-24 00:57:37,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:37,372 INFO L225 Difference]: With dead ends: 8068 [2024-10-24 00:57:37,373 INFO L226 Difference]: Without dead ends: 5436 [2024-10-24 00:57:37,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:57:37,385 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 937 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:37,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 747 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:57:37,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5436 states. [2024-10-24 00:57:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5436 to 5316. [2024-10-24 00:57:37,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5316 states, 4338 states have (on average 1.6454587367450437) internal successors, (7138), 4345 states have internal predecessors, (7138), 957 states have call successors, (957), 16 states have call predecessors, (957), 20 states have return successors, (1074), 956 states have call predecessors, (1074), 956 states have call successors, (1074) [2024-10-24 00:57:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 9169 transitions. [2024-10-24 00:57:37,645 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 9169 transitions. Word has length 106 [2024-10-24 00:57:37,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:37,645 INFO L471 AbstractCegarLoop]: Abstraction has 5316 states and 9169 transitions. [2024-10-24 00:57:37,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 9169 transitions. [2024-10-24 00:57:37,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 00:57:37,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:37,659 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:37,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 00:57:37,660 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:37,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:37,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1541707882, now seen corresponding path program 1 times [2024-10-24 00:57:37,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:37,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924777933] [2024-10-24 00:57:37,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:37,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:37,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:37,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:37,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:37,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:37,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:37,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:37,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:57:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:37,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:57:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:37,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:57:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:37,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:57:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:37,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:57:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:37,765 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:37,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:37,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924777933] [2024-10-24 00:57:37,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924777933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:37,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:37,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:57:37,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285615901] [2024-10-24 00:57:37,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:37,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:57:37,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:37,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:57:37,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:57:37,767 INFO L87 Difference]: Start difference. First operand 5316 states and 9169 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:39,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:39,015 INFO L93 Difference]: Finished difference Result 13205 states and 23247 transitions. [2024-10-24 00:57:39,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:57:39,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2024-10-24 00:57:39,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:39,059 INFO L225 Difference]: With dead ends: 13205 [2024-10-24 00:57:39,059 INFO L226 Difference]: Without dead ends: 8969 [2024-10-24 00:57:39,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:57:39,079 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 935 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:39,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 721 Invalid, 1597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:57:39,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8969 states. [2024-10-24 00:57:39,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8969 to 8849. [2024-10-24 00:57:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8849 states, 7265 states have (on average 1.6426703372333105) internal successors, (11934), 7272 states have internal predecessors, (11934), 1563 states have call successors, (1563), 16 states have call predecessors, (1563), 20 states have return successors, (1758), 1562 states have call predecessors, (1758), 1562 states have call successors, (1758) [2024-10-24 00:57:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8849 states to 8849 states and 15255 transitions. [2024-10-24 00:57:39,540 INFO L78 Accepts]: Start accepts. Automaton has 8849 states and 15255 transitions. Word has length 107 [2024-10-24 00:57:39,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:39,541 INFO L471 AbstractCegarLoop]: Abstraction has 8849 states and 15255 transitions. [2024-10-24 00:57:39,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand 8849 states and 15255 transitions. [2024-10-24 00:57:39,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 00:57:39,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:39,558 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:39,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 00:57:39,559 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:39,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:39,559 INFO L85 PathProgramCache]: Analyzing trace with hash -209401347, now seen corresponding path program 1 times [2024-10-24 00:57:39,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:39,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554362266] [2024-10-24 00:57:39,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:39,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:39,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:39,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:39,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:39,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:39,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:39,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:39,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:57:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:39,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:57:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:39,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:57:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:39,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:57:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:39,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:57:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:39,657 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:39,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:39,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554362266] [2024-10-24 00:57:39,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554362266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:39,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:39,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:57:39,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263083480] [2024-10-24 00:57:39,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:39,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:57:39,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:39,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:57:39,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:57:39,659 INFO L87 Difference]: Start difference. First operand 8849 states and 15255 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:40,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:40,999 INFO L93 Difference]: Finished difference Result 22977 states and 40381 transitions. [2024-10-24 00:57:40,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:57:40,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-10-24 00:57:40,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:41,065 INFO L225 Difference]: With dead ends: 22977 [2024-10-24 00:57:41,065 INFO L226 Difference]: Without dead ends: 15641 [2024-10-24 00:57:41,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:57:41,095 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 933 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:41,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 754 Invalid, 1617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:57:41,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15641 states. [2024-10-24 00:57:41,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15641 to 15521. [2024-10-24 00:57:41,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15521 states, 12734 states have (on average 1.633029684309722) internal successors, (20795), 12741 states have internal predecessors, (20795), 2766 states have call successors, (2766), 16 states have call predecessors, (2766), 20 states have return successors, (3105), 2765 states have call predecessors, (3105), 2765 states have call successors, (3105) [2024-10-24 00:57:41,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15521 states to 15521 states and 26666 transitions. [2024-10-24 00:57:41,713 INFO L78 Accepts]: Start accepts. Automaton has 15521 states and 26666 transitions. Word has length 108 [2024-10-24 00:57:41,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:41,714 INFO L471 AbstractCegarLoop]: Abstraction has 15521 states and 26666 transitions. [2024-10-24 00:57:41,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:41,715 INFO L276 IsEmpty]: Start isEmpty. Operand 15521 states and 26666 transitions. [2024-10-24 00:57:41,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 00:57:41,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:41,737 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:41,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 00:57:41,737 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:41,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:41,738 INFO L85 PathProgramCache]: Analyzing trace with hash 26754697, now seen corresponding path program 1 times [2024-10-24 00:57:41,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:41,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752651729] [2024-10-24 00:57:41,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:41,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:41,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:41,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:41,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:41,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:41,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:41,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:41,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:57:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:41,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:57:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:41,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:57:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:41,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:57:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:41,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:57:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:41,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:41,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752651729] [2024-10-24 00:57:41,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752651729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:41,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:41,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:57:41,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672458441] [2024-10-24 00:57:41,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:41,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:57:41,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:41,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:57:41,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:57:41,964 INFO L87 Difference]: Start difference. First operand 15521 states and 26666 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:43,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:43,539 INFO L93 Difference]: Finished difference Result 41144 states and 72181 transitions. [2024-10-24 00:57:43,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:57:43,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2024-10-24 00:57:43,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:43,673 INFO L225 Difference]: With dead ends: 41144 [2024-10-24 00:57:43,673 INFO L226 Difference]: Without dead ends: 27756 [2024-10-24 00:57:43,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:57:43,827 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 931 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:43,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 712 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:57:43,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27756 states. [2024-10-24 00:57:44,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27756 to 27636. [2024-10-24 00:57:44,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27636 states, 22810 states have (on average 1.6290661990355106) internal successors, (37159), 22817 states have internal predecessors, (37159), 4805 states have call successors, (4805), 16 states have call predecessors, (4805), 20 states have return successors, (5418), 4804 states have call predecessors, (5418), 4804 states have call successors, (5418) [2024-10-24 00:57:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27636 states to 27636 states and 47382 transitions. [2024-10-24 00:57:44,839 INFO L78 Accepts]: Start accepts. Automaton has 27636 states and 47382 transitions. Word has length 109 [2024-10-24 00:57:44,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:44,840 INFO L471 AbstractCegarLoop]: Abstraction has 27636 states and 47382 transitions. [2024-10-24 00:57:44,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:44,840 INFO L276 IsEmpty]: Start isEmpty. Operand 27636 states and 47382 transitions. [2024-10-24 00:57:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 00:57:44,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:44,867 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:44,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 00:57:44,867 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:44,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:44,868 INFO L85 PathProgramCache]: Analyzing trace with hash -430168613, now seen corresponding path program 1 times [2024-10-24 00:57:44,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:44,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942782936] [2024-10-24 00:57:44,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:44,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:57:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:57:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:57:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:57:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:57:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,218 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:45,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:45,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942782936] [2024-10-24 00:57:45,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942782936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:45,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:45,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:57:45,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291391486] [2024-10-24 00:57:45,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:45,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:57:45,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:45,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:57:45,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:57:45,221 INFO L87 Difference]: Start difference. First operand 27636 states and 47382 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:47,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:47,622 INFO L93 Difference]: Finished difference Result 75336 states and 131370 transitions. [2024-10-24 00:57:47,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:57:47,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2024-10-24 00:57:47,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:47,843 INFO L225 Difference]: With dead ends: 75336 [2024-10-24 00:57:47,843 INFO L226 Difference]: Without dead ends: 50580 [2024-10-24 00:57:48,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:57:48,114 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 929 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:48,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 715 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 00:57:48,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50580 states. [2024-10-24 00:57:50,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50580 to 50460. [2024-10-24 00:57:50,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50460 states, 41919 states have (on average 1.6239175552851928) internal successors, (68073), 41926 states have internal predecessors, (68073), 8520 states have call successors, (8520), 16 states have call predecessors, (8520), 20 states have return successors, (9665), 8519 states have call predecessors, (9665), 8519 states have call successors, (9665) [2024-10-24 00:57:50,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50460 states to 50460 states and 86258 transitions. [2024-10-24 00:57:50,273 INFO L78 Accepts]: Start accepts. Automaton has 50460 states and 86258 transitions. Word has length 110 [2024-10-24 00:57:50,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:50,274 INFO L471 AbstractCegarLoop]: Abstraction has 50460 states and 86258 transitions. [2024-10-24 00:57:50,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:50,274 INFO L276 IsEmpty]: Start isEmpty. Operand 50460 states and 86258 transitions. [2024-10-24 00:57:50,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 00:57:50,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:50,296 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:50,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 00:57:50,296 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:50,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:50,296 INFO L85 PathProgramCache]: Analyzing trace with hash -437264791, now seen corresponding path program 1 times [2024-10-24 00:57:50,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:50,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663246587] [2024-10-24 00:57:50,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:50,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:50,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:50,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:50,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:50,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:50,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:50,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:50,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:57:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:50,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:57:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:50,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:57:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:50,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:57:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:50,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 00:57:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:50,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:50,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663246587] [2024-10-24 00:57:50,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663246587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:50,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:50,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:57:50,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049724856] [2024-10-24 00:57:50,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:50,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:57:50,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:50,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:57:50,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:57:50,409 INFO L87 Difference]: Start difference. First operand 50460 states and 86258 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:53,600 INFO L93 Difference]: Finished difference Result 94083 states and 164533 transitions. [2024-10-24 00:57:53,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:57:53,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2024-10-24 00:57:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:54,115 INFO L225 Difference]: With dead ends: 94083 [2024-10-24 00:57:54,115 INFO L226 Difference]: Without dead ends: 93960 [2024-10-24 00:57:54,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:57:54,184 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 924 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:54,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 724 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:57:54,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93960 states. [2024-10-24 00:57:57,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93960 to 93840. [2024-10-24 00:57:57,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93840 states, 78500 states have (on average 1.617375796178344) internal successors, (126964), 78507 states have internal predecessors, (126964), 15319 states have call successors, (15319), 16 states have call predecessors, (15319), 20 states have return successors, (17510), 15318 states have call predecessors, (17510), 15318 states have call successors, (17510) [2024-10-24 00:57:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93840 states to 93840 states and 159793 transitions. [2024-10-24 00:57:57,506 INFO L78 Accepts]: Start accepts. Automaton has 93840 states and 159793 transitions. Word has length 111 [2024-10-24 00:57:57,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:57,507 INFO L471 AbstractCegarLoop]: Abstraction has 93840 states and 159793 transitions. [2024-10-24 00:57:57,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:57:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand 93840 states and 159793 transitions. [2024-10-24 00:57:57,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 00:57:57,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:57,526 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:57,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 00:57:57,527 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:57,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:57,527 INFO L85 PathProgramCache]: Analyzing trace with hash 662008892, now seen corresponding path program 1 times [2024-10-24 00:57:57,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:57,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669625907] [2024-10-24 00:57:57,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:57,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:57,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:57:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:57:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:57:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:57:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 00:57:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:58,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:58,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669625907] [2024-10-24 00:57:58,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669625907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:58,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:58,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-24 00:57:58,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898867310] [2024-10-24 00:57:58,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:58,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 00:57:58,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:58,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 00:57:58,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-24 00:57:58,513 INFO L87 Difference]: Start difference. First operand 93840 states and 159793 transitions. Second operand has 16 states, 15 states have (on average 5.0) internal successors, (75), 10 states have internal predecessors, (75), 5 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-24 00:58:06,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:06,583 INFO L93 Difference]: Finished difference Result 187329 states and 330974 transitions. [2024-10-24 00:58:06,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-24 00:58:06,584 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 10 states have internal predecessors, (75), 5 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 112 [2024-10-24 00:58:06,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:07,452 INFO L225 Difference]: With dead ends: 187329 [2024-10-24 00:58:07,452 INFO L226 Difference]: Without dead ends: 187211 [2024-10-24 00:58:07,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=648, Invalid=2544, Unknown=0, NotChecked=0, Total=3192 [2024-10-24 00:58:07,530 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 2966 mSDsluCounter, 2140 mSDsCounter, 0 mSdLazyCounter, 5692 mSolverCounterSat, 976 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2978 SdHoareTripleChecker+Valid, 2352 SdHoareTripleChecker+Invalid, 6668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 976 IncrementalHoareTripleChecker+Valid, 5692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:07,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2978 Valid, 2352 Invalid, 6668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [976 Valid, 5692 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-24 00:58:07,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187211 states. [2024-10-24 00:58:13,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187211 to 186870. [2024-10-24 00:58:13,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186870 states, 156390 states have (on average 1.6182748257561226) internal successors, (253082), 156293 states have internal predecessors, (253082), 30430 states have call successors, (30430), 41 states have call predecessors, (30430), 49 states have return successors, (38087), 30541 states have call predecessors, (38087), 30427 states have call successors, (38087) [2024-10-24 00:58:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186870 states to 186870 states and 321599 transitions. [2024-10-24 00:58:14,627 INFO L78 Accepts]: Start accepts. Automaton has 186870 states and 321599 transitions. Word has length 112 [2024-10-24 00:58:14,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:14,628 INFO L471 AbstractCegarLoop]: Abstraction has 186870 states and 321599 transitions. [2024-10-24 00:58:14,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 10 states have internal predecessors, (75), 5 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-24 00:58:14,628 INFO L276 IsEmpty]: Start isEmpty. Operand 186870 states and 321599 transitions. [2024-10-24 00:58:14,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 00:58:14,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:14,682 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:14,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 00:58:14,682 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:14,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:14,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1347202769, now seen corresponding path program 1 times [2024-10-24 00:58:14,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:14,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210972336] [2024-10-24 00:58:14,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:14,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:58:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:58:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:58:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:58:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 00:58:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:14,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:14,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210972336] [2024-10-24 00:58:14,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210972336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:14,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:14,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:58:14,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919277373] [2024-10-24 00:58:14,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:14,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:58:14,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:14,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:58:14,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:58:14,984 INFO L87 Difference]: Start difference. First operand 186870 states and 321599 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 6 states have internal predecessors, (76), 4 states have call successors, (13), 7 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-24 00:58:22,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:22,469 INFO L93 Difference]: Finished difference Result 188030 states and 329918 transitions. [2024-10-24 00:58:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 00:58:22,470 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 6 states have internal predecessors, (76), 4 states have call successors, (13), 7 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 113 [2024-10-24 00:58:22,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:23,270 INFO L225 Difference]: With dead ends: 188030 [2024-10-24 00:58:23,270 INFO L226 Difference]: Without dead ends: 187262 [2024-10-24 00:58:23,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2024-10-24 00:58:23,357 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 1864 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1879 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 3322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 608 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:23,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1879 Valid, 1180 Invalid, 3322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [608 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]