./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec9_product16.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:50:15,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:50:15,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:50:15,521 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:50:15,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:50:15,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:50:15,542 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:50:15,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:50:15,543 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:50:15,544 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:50:15,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:50:15,545 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:50:15,546 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:50:15,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:50:15,546 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:50:15,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:50:15,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:50:15,547 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:50:15,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:50:15,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:50:15,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:50:15,549 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:50:15,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:50:15,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:50:15,549 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:50:15,550 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:50:15,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:50:15,550 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:50:15,550 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:50:15,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:50:15,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:50:15,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:50:15,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:50:15,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:50:15,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:50:15,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:50:15,553 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:50:15,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:50:15,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:50:15,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:50:15,554 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:50:15,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:50:15,554 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-11-11 20:50:15,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:50:15,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:50:15,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:50:15,825 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:50:15,826 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:50:15,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec9_product16.cil.c [2024-11-11 20:50:17,373 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:50:17,664 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:50:17,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product16.cil.c [2024-11-11 20:50:17,695 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d26f5b61b/c2d7482a7af84712a2be69291cf61fcd/FLAGd0f30ccc7 [2024-11-11 20:50:17,952 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d26f5b61b/c2d7482a7af84712a2be69291cf61fcd [2024-11-11 20:50:17,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:50:17,956 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:50:17,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:50:17,958 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:50:17,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:50:17,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:50:17" (1/1) ... [2024-11-11 20:50:17,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33c3fae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:17, skipping insertion in model container [2024-11-11 20:50:17,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:50:17" (1/1) ... [2024-11-11 20:50:18,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:50:18,508 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product16.cil.c[33283,33296] [2024-11-11 20:50:18,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:50:18,631 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:50:18,641 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [48] [2024-11-11 20:50:18,643 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [105] [2024-11-11 20:50:18,643 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [216] [2024-11-11 20:50:18,644 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [233] [2024-11-11 20:50:18,644 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [599] [2024-11-11 20:50:18,644 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1004] [2024-11-11 20:50:18,644 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1278] [2024-11-11 20:50:18,644 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1316] [2024-11-11 20:50:18,645 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1541] [2024-11-11 20:50:18,645 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1550] [2024-11-11 20:50:18,646 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1832] [2024-11-11 20:50:18,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product16.cil.c[33283,33296] [2024-11-11 20:50:18,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:50:18,801 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:50:18,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:18 WrapperNode [2024-11-11 20:50:18,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:50:18,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:50:18,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:50:18,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:50:18,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:18" (1/1) ... [2024-11-11 20:50:18,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:18" (1/1) ... [2024-11-11 20:50:18,902 INFO L138 Inliner]: procedures = 126, calls = 185, calls flagged for inlining = 57, calls inlined = 52, statements flattened = 1003 [2024-11-11 20:50:18,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:50:18,903 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:50:18,903 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:50:18,904 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:50:18,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:18" (1/1) ... [2024-11-11 20:50:18,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:18" (1/1) ... [2024-11-11 20:50:18,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:18" (1/1) ... [2024-11-11 20:50:18,951 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-11-11 20:50:18,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:18" (1/1) ... [2024-11-11 20:50:18,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:18" (1/1) ... [2024-11-11 20:50:18,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:18" (1/1) ... [2024-11-11 20:50:18,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:18" (1/1) ... [2024-11-11 20:50:18,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:18" (1/1) ... [2024-11-11 20:50:18,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:18" (1/1) ... [2024-11-11 20:50:18,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:50:18,990 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:50:18,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:50:18,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:50:18,991 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:18" (1/1) ... [2024-11-11 20:50:19,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:50:19,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:50:19,039 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 20:50:19,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 20:50:19,090 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-11-11 20:50:19,090 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-11-11 20:50:19,090 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-11-11 20:50:19,091 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-11-11 20:50:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-11 20:50:19,091 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-11 20:50:19,091 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-11 20:50:19,092 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-11 20:50:19,093 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-11 20:50:19,093 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-11 20:50:19,093 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-11-11 20:50:19,093 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-11-11 20:50:19,093 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-11 20:50:19,093 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-11 20:50:19,094 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-11 20:50:19,094 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-11 20:50:19,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:50:19,095 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-11 20:50:19,096 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-11 20:50:19,096 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-11 20:50:19,096 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-11 20:50:19,096 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-11 20:50:19,096 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-11 20:50:19,097 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-11 20:50:19,097 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-11 20:50:19,097 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-11-11 20:50:19,097 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-11-11 20:50:19,097 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-11 20:50:19,097 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-11 20:50:19,097 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-11 20:50:19,097 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-11 20:50:19,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:50:19,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:50:19,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:50:19,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:50:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-11 20:50:19,098 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-11 20:50:19,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:50:19,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:50:19,350 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:50:19,353 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:50:20,218 INFO L? ?]: Removed 417 outVars from TransFormulas that were not future-live. [2024-11-11 20:50:20,219 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:50:20,241 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:50:20,241 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:50:20,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:50:20 BoogieIcfgContainer [2024-11-11 20:50:20,242 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:50:20,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:50:20,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:50:20,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:50:20,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:50:17" (1/3) ... [2024-11-11 20:50:20,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a71e13a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:50:20, skipping insertion in model container [2024-11-11 20:50:20,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:50:18" (2/3) ... [2024-11-11 20:50:20,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a71e13a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:50:20, skipping insertion in model container [2024-11-11 20:50:20,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:50:20" (3/3) ... [2024-11-11 20:50:20,251 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec9_product16.cil.c [2024-11-11 20:50:20,266 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:50:20,267 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:50:20,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:50:20,344 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;@7bf8ecb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:50:20,345 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:50:20,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 299 states, 236 states have (on average 1.5338983050847457) internal successors, (362), 240 states have internal predecessors, (362), 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-11-11 20:50:20,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-11 20:50:20,373 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:20,374 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:20,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:20,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:20,381 INFO L85 PathProgramCache]: Analyzing trace with hash -806898450, now seen corresponding path program 1 times [2024-11-11 20:50:20,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:20,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906804338] [2024-11-11 20:50:20,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:20,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:21,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:21,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:21,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:21,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:50:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:21,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:50:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:21,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:50:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:21,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:50:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:21,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 20:50:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:21,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:50:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:21,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:50:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:21,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:50:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:21,167 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 20:50:21,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:21,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906804338] [2024-11-11 20:50:21,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906804338] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:50:21,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273678030] [2024-11-11 20:50:21,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:21,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:50:21,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:50:21,171 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:50:21,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:50:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:21,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 20:50:21,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:50:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:50:21,537 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:50:21,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273678030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:21,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:50:21,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-11 20:50:21,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327456012] [2024-11-11 20:50:21,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:21,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:50:21,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:21,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:50:21,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:50:21,578 INFO L87 Difference]: Start difference. First operand has 299 states, 236 states have (on average 1.5338983050847457) internal successors, (362), 240 states have internal predecessors, (362), 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 25.0) internal successors, (50), 2 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-11-11 20:50:21,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:21,647 INFO L93 Difference]: Finished difference Result 444 states and 658 transitions. [2024-11-11 20:50:21,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:50:21,651 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 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-11-11 20:50:21,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:21,690 INFO L225 Difference]: With dead ends: 444 [2024-11-11 20:50:21,691 INFO L226 Difference]: Without dead ends: 292 [2024-11-11 20:50:21,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:50:21,703 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:21,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:50:21,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-11 20:50:21,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2024-11-11 20:50:21,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 230 states have (on average 1.5260869565217392) internal successors, (351), 233 states have internal predecessors, (351), 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-11-11 20:50:21,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 440 transitions. [2024-11-11 20:50:21,789 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 440 transitions. Word has length 89 [2024-11-11 20:50:21,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:21,792 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 440 transitions. [2024-11-11 20:50:21,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 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-11-11 20:50:21,793 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 440 transitions. [2024-11-11 20:50:21,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-11 20:50:21,803 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:21,803 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:21,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 20:50:22,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-11 20:50:22,005 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:22,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:22,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1177822227, now seen corresponding path program 1 times [2024-11-11 20:50:22,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:22,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549929667] [2024-11-11 20:50:22,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:22,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:22,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:22,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:22,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:22,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:50:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:22,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:50:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:22,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:50:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:22,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:50:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:22,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:50:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:22,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:50:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:22,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:50:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:22,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:50:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:22,344 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 20:50:22,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:22,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549929667] [2024-11-11 20:50:22,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549929667] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:50:22,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087427696] [2024-11-11 20:50:22,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:22,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:50:22,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:50:22,350 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:50:22,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 20:50:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:22,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 20:50:22,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:50:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:50:22,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:50:22,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087427696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:22,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:50:22,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-11 20:50:22,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552127591] [2024-11-11 20:50:22,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:22,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:50:22,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:22,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:50:22,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:50:22,651 INFO L87 Difference]: Start difference. First operand 292 states and 440 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:50:22,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:22,709 INFO L93 Difference]: Finished difference Result 434 states and 639 transitions. [2024-11-11 20:50:22,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:50:22,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 90 [2024-11-11 20:50:22,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:22,714 INFO L225 Difference]: With dead ends: 434 [2024-11-11 20:50:22,714 INFO L226 Difference]: Without dead ends: 295 [2024-11-11 20:50:22,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:50:22,716 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 1 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:22,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 874 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:50:22,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-11 20:50:22,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 294. [2024-11-11 20:50:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 232 states have (on average 1.521551724137931) internal successors, (353), 235 states have internal predecessors, (353), 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-11-11 20:50:22,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 442 transitions. [2024-11-11 20:50:22,734 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 442 transitions. Word has length 90 [2024-11-11 20:50:22,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:22,734 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 442 transitions. [2024-11-11 20:50:22,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:50:22,735 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 442 transitions. [2024-11-11 20:50:22,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-11 20:50:22,737 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:22,738 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:22,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 20:50:22,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-11 20:50:22,942 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:22,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:22,942 INFO L85 PathProgramCache]: Analyzing trace with hash 213599068, now seen corresponding path program 1 times [2024-11-11 20:50:22,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:22,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293466797] [2024-11-11 20:50:22,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:22,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:23,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:23,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:23,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:23,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:50:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:23,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:50:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:23,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:50:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:23,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 20:50:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:23,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:50:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:23,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:50:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:23,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:50:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:23,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:50:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:50:23,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:23,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293466797] [2024-11-11 20:50:23,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293466797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:50:23,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925267494] [2024-11-11 20:50:23,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:23,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:50:23,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:50:23,215 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:50:23,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 20:50:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:23,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 932 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:50:23,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:50:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:50:23,518 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:50:23,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925267494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:23,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:50:23,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-11 20:50:23,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124750503] [2024-11-11 20:50:23,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:23,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:50:23,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:23,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:50:23,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:50:23,521 INFO L87 Difference]: Start difference. First operand 294 states and 442 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:50:23,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:23,561 INFO L93 Difference]: Finished difference Result 618 states and 943 transitions. [2024-11-11 20:50:23,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:50:23,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 96 [2024-11-11 20:50:23,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:23,580 INFO L225 Difference]: With dead ends: 618 [2024-11-11 20:50:23,580 INFO L226 Difference]: Without dead ends: 351 [2024-11-11 20:50:23,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:50:23,584 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 107 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:23,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 847 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:50:23,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-11 20:50:23,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 343. [2024-11-11 20:50:23,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 270 states have (on average 1.537037037037037) internal successors, (415), 273 states have internal predecessors, (415), 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-11-11 20:50:23,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 526 transitions. [2024-11-11 20:50:23,611 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 526 transitions. Word has length 96 [2024-11-11 20:50:23,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:23,612 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 526 transitions. [2024-11-11 20:50:23,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:50:23,612 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 526 transitions. [2024-11-11 20:50:23,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-11 20:50:23,614 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:23,614 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:23,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 20:50:23,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:50:23,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:23,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:23,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1191934709, now seen corresponding path program 1 times [2024-11-11 20:50:23,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:23,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394893420] [2024-11-11 20:50:23,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:23,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:23,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:23,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:23,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:24,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:50:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:24,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:50:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:24,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:50:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:24,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:50:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:24,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:50:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:24,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:50:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:24,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:50:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:24,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:50:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:24,061 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:50:24,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:24,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394893420] [2024-11-11 20:50:24,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394893420] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:50:24,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848324531] [2024-11-11 20:50:24,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:24,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:50:24,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:50:24,065 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:50:24,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 20:50:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:24,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:50:24,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:50:24,388 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:50:24,389 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:50:24,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848324531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:24,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:50:24,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-11 20:50:24,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535676924] [2024-11-11 20:50:24,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:24,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:50:24,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:24,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:50:24,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:50:24,391 INFO L87 Difference]: Start difference. First operand 343 states and 526 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:50:24,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:24,460 INFO L93 Difference]: Finished difference Result 677 states and 1042 transitions. [2024-11-11 20:50:24,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:50:24,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 97 [2024-11-11 20:50:24,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:24,465 INFO L225 Difference]: With dead ends: 677 [2024-11-11 20:50:24,465 INFO L226 Difference]: Without dead ends: 345 [2024-11-11 20:50:24,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:50:24,469 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 2 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:24,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1717 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:50:24,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-11 20:50:24,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2024-11-11 20:50:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 271 states have (on average 1.5350553505535056) internal successors, (416), 275 states have internal predecessors, (416), 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-11-11 20:50:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 529 transitions. [2024-11-11 20:50:24,492 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 529 transitions. Word has length 97 [2024-11-11 20:50:24,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:24,493 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 529 transitions. [2024-11-11 20:50:24,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:50:24,493 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 529 transitions. [2024-11-11 20:50:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-11 20:50:24,495 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:24,495 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:24,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 20:50:24,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:50:24,696 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:24,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:24,697 INFO L85 PathProgramCache]: Analyzing trace with hash -398998019, now seen corresponding path program 1 times [2024-11-11 20:50:24,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:24,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260664629] [2024-11-11 20:50:24,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:24,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:24,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:24,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:24,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:24,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:24,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:24,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:50:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:24,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:50:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:24,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:50:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:24,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:50:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:24,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:50:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:24,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:50:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:24,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:50:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:50:24,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:24,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260664629] [2024-11-11 20:50:24,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260664629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:50:24,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241953021] [2024-11-11 20:50:24,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:24,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:50:24,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:50:24,941 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:50:24,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 20:50:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:25,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 20:50:25,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:50:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:50:25,251 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:50:25,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241953021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:25,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:50:25,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-11 20:50:25,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422896661] [2024-11-11 20:50:25,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:25,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:50:25,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:25,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:50:25,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:50:25,256 INFO L87 Difference]: Start difference. First operand 345 states and 529 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:50:25,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:25,325 INFO L93 Difference]: Finished difference Result 679 states and 1047 transitions. [2024-11-11 20:50:25,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:50:25,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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 98 [2024-11-11 20:50:25,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:25,328 INFO L225 Difference]: With dead ends: 679 [2024-11-11 20:50:25,329 INFO L226 Difference]: Without dead ends: 347 [2024-11-11 20:50:25,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:50:25,331 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 2 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:25,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1703 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:50:25,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-11 20:50:25,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-11-11 20:50:25,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 272 states have (on average 1.5330882352941178) internal successors, (417), 277 states have internal predecessors, (417), 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-11-11 20:50:25,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 535 transitions. [2024-11-11 20:50:25,354 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 535 transitions. Word has length 98 [2024-11-11 20:50:25,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:25,354 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 535 transitions. [2024-11-11 20:50:25,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:50:25,354 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 535 transitions. [2024-11-11 20:50:25,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 20:50:25,357 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:25,357 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:25,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 20:50:25,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:50:25,558 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:25,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:25,559 INFO L85 PathProgramCache]: Analyzing trace with hash 262721501, now seen corresponding path program 1 times [2024-11-11 20:50:25,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:25,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722665916] [2024-11-11 20:50:25,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:25,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:25,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:25,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:25,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:25,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:25,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:25,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:50:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:25,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:50:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:25,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:50:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:25,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:50:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:25,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:50:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:25,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:50:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:25,787 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:50:25,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:25,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722665916] [2024-11-11 20:50:25,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722665916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:25,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:25,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:50:25,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142423012] [2024-11-11 20:50:25,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:25,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:50:25,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:25,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:50:25,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:50:25,791 INFO L87 Difference]: Start difference. First operand 347 states and 535 transitions. Second operand has 9 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:50:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:27,792 INFO L93 Difference]: Finished difference Result 819 states and 1261 transitions. [2024-11-11 20:50:27,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:50:27,793 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 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 99 [2024-11-11 20:50:27,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:27,797 INFO L225 Difference]: With dead ends: 819 [2024-11-11 20:50:27,797 INFO L226 Difference]: Without dead ends: 495 [2024-11-11 20:50:27,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-11 20:50:27,799 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 914 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 2299 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 2570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 2299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:27,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 1108 Invalid, 2570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 2299 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 20:50:27,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-11-11 20:50:27,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 347. [2024-11-11 20:50:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 272 states have (on average 1.5330882352941178) internal successors, (417), 277 states have internal predecessors, (417), 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-11-11 20:50:27,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 534 transitions. [2024-11-11 20:50:27,831 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 534 transitions. Word has length 99 [2024-11-11 20:50:27,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:27,831 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 534 transitions. [2024-11-11 20:50:27,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:50:27,831 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 534 transitions. [2024-11-11 20:50:27,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 20:50:27,833 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:27,833 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:27,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:50:27,834 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:27,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:27,834 INFO L85 PathProgramCache]: Analyzing trace with hash 963094467, now seen corresponding path program 2 times [2024-11-11 20:50:27,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:27,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721994314] [2024-11-11 20:50:27,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:27,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:27,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:27,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:27,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:27,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:27,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:28,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:50:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:28,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:50:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:28,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:50:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:28,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:50:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:28,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:50:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:28,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:50:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:50:28,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:28,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721994314] [2024-11-11 20:50:28,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721994314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:28,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:28,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:50:28,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656100212] [2024-11-11 20:50:28,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:28,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:50:28,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:28,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:50:28,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:50:28,053 INFO L87 Difference]: Start difference. First operand 347 states and 534 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:50:29,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:29,884 INFO L93 Difference]: Finished difference Result 821 states and 1264 transitions. [2024-11-11 20:50:29,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:50:29,885 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2024-11-11 20:50:29,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:29,890 INFO L225 Difference]: With dead ends: 821 [2024-11-11 20:50:29,891 INFO L226 Difference]: Without dead ends: 497 [2024-11-11 20:50:29,892 INFO L434 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-11-11 20:50:29,893 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 910 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 2317 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 2587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:29,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 1108 Invalid, 2587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 2317 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 20:50:29,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-11 20:50:29,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 349. [2024-11-11 20:50:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 273 states have (on average 1.531135531135531) internal successors, (418), 279 states have internal predecessors, (418), 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-11-11 20:50:29,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 537 transitions. [2024-11-11 20:50:29,933 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 537 transitions. Word has length 100 [2024-11-11 20:50:29,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:29,933 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 537 transitions. [2024-11-11 20:50:29,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:50:29,934 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 537 transitions. [2024-11-11 20:50:29,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 20:50:29,936 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:29,937 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:29,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:50:29,939 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:29,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:29,939 INFO L85 PathProgramCache]: Analyzing trace with hash -868146014, now seen corresponding path program 1 times [2024-11-11 20:50:29,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:29,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081727693] [2024-11-11 20:50:29,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:29,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:30,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:30,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:30,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:30,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:30,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:30,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:50:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:30,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:50:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:30,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:50:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:30,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:50:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:30,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:50:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:30,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:50:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:30,183 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:50:30,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:30,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081727693] [2024-11-11 20:50:30,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081727693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:30,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:30,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:50:30,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731973869] [2024-11-11 20:50:30,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:30,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:50:30,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:30,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:50:30,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:50:30,186 INFO L87 Difference]: Start difference. First operand 349 states and 537 transitions. Second operand has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-11 20:50:32,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:32,487 INFO L93 Difference]: Finished difference Result 819 states and 1259 transitions. [2024-11-11 20:50:32,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:50:32,488 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 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 101 [2024-11-11 20:50:32,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:32,492 INFO L225 Difference]: With dead ends: 819 [2024-11-11 20:50:32,492 INFO L226 Difference]: Without dead ends: 497 [2024-11-11 20:50:32,493 INFO L434 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-11-11 20:50:32,494 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 914 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 3803 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 4080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 3803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:32,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 1535 Invalid, 4080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 3803 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 20:50:32,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-11 20:50:32,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 349. [2024-11-11 20:50:32,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 273 states have (on average 1.531135531135531) internal successors, (418), 279 states have internal predecessors, (418), 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-11-11 20:50:32,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 536 transitions. [2024-11-11 20:50:32,522 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 536 transitions. Word has length 101 [2024-11-11 20:50:32,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:32,523 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 536 transitions. [2024-11-11 20:50:32,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-11 20:50:32,523 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 536 transitions. [2024-11-11 20:50:32,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-11 20:50:32,525 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:32,525 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:32,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:50:32,525 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:32,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:32,526 INFO L85 PathProgramCache]: Analyzing trace with hash 400437826, now seen corresponding path program 2 times [2024-11-11 20:50:32,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:32,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246898277] [2024-11-11 20:50:32,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:32,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:32,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:32,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:32,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:32,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:32,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:32,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:50:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:32,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:50:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:32,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 20:50:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:32,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:50:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:32,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:50:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:32,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:50:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:32,764 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:50:32,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:32,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246898277] [2024-11-11 20:50:32,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246898277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:32,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:32,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:50:32,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751843753] [2024-11-11 20:50:32,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:32,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:50:32,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:32,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:50:32,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:50:32,767 INFO L87 Difference]: Start difference. First operand 349 states and 536 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-11 20:50:35,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:35,170 INFO L93 Difference]: Finished difference Result 821 states and 1265 transitions. [2024-11-11 20:50:35,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:50:35,171 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 102 [2024-11-11 20:50:35,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:35,176 INFO L225 Difference]: With dead ends: 821 [2024-11-11 20:50:35,176 INFO L226 Difference]: Without dead ends: 499 [2024-11-11 20:50:35,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-11 20:50:35,180 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 910 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 3848 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 4121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 3848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:35,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 1536 Invalid, 4121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 3848 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 20:50:35,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-11-11 20:50:35,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 351. [2024-11-11 20:50:35,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 274 states have (on average 1.5291970802919708) internal successors, (419), 281 states have internal predecessors, (419), 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-11-11 20:50:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 542 transitions. [2024-11-11 20:50:35,207 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 542 transitions. Word has length 102 [2024-11-11 20:50:35,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:35,207 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 542 transitions. [2024-11-11 20:50:35,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-11 20:50:35,208 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 542 transitions. [2024-11-11 20:50:35,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 20:50:35,209 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:35,209 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:35,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:50:35,210 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:35,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:35,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1821386649, now seen corresponding path program 1 times [2024-11-11 20:50:35,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:35,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329171153] [2024-11-11 20:50:35,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:35,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:35,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:35,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:35,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:35,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:35,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:35,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:50:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:35,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:50:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:35,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:50:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:35,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:50:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:35,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:50:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:35,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:50:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:35,357 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:50:35,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:35,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329171153] [2024-11-11 20:50:35,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329171153] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:50:35,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382878613] [2024-11-11 20:50:35,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:35,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:50:35,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:50:35,360 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:50:35,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 20:50:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:35,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 943 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:50:35,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:50:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:50:35,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:50:35,743 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:50:35,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382878613] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:50:35,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:50:35,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-11-11 20:50:35,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029381455] [2024-11-11 20:50:35,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:50:35,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 20:50:35,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:35,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 20:50:35,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:50:35,748 INFO L87 Difference]: Start difference. First operand 351 states and 542 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 7 states have internal predecessors, (96), 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-11-11 20:50:37,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:37,501 INFO L93 Difference]: Finished difference Result 990 states and 1593 transitions. [2024-11-11 20:50:37,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:50:37,501 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 7 states have internal predecessors, (96), 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 103 [2024-11-11 20:50:37,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:37,512 INFO L225 Difference]: With dead ends: 990 [2024-11-11 20:50:37,513 INFO L226 Difference]: Without dead ends: 851 [2024-11-11 20:50:37,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-11 20:50:37,516 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 1322 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 1960 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1367 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 2377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 1960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:37,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1367 Valid, 1321 Invalid, 2377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 1960 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 20:50:37,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2024-11-11 20:50:37,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 679. [2024-11-11 20:50:37,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 538 states have (on average 1.5929368029739777) internal successors, (857), 545 states have internal predecessors, (857), 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-11-11 20:50:37,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1118 transitions. [2024-11-11 20:50:37,606 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1118 transitions. Word has length 103 [2024-11-11 20:50:37,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:37,606 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 1118 transitions. [2024-11-11 20:50:37,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 7 states have internal predecessors, (96), 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-11-11 20:50:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1118 transitions. [2024-11-11 20:50:37,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-11 20:50:37,612 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:37,612 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:37,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 20:50:37,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:50:37,814 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:37,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:37,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1014946556, now seen corresponding path program 1 times [2024-11-11 20:50:37,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:37,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565719064] [2024-11-11 20:50:37,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:37,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:37,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:37,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:37,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:37,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:37,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:37,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:50:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:37,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:50:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:37,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:50:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:37,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:50:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:37,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:50:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:37,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:50:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:37,946 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:50:37,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:37,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565719064] [2024-11-11 20:50:37,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565719064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:37,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:37,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:50:37,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333541840] [2024-11-11 20:50:37,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:37,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:50:37,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:37,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:50:37,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:50:37,949 INFO L87 Difference]: Start difference. First operand 679 states and 1118 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:50:39,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:39,264 INFO L93 Difference]: Finished difference Result 1771 states and 2964 transitions. [2024-11-11 20:50:39,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:50:39,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2024-11-11 20:50:39,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:39,272 INFO L225 Difference]: With dead ends: 1771 [2024-11-11 20:50:39,272 INFO L226 Difference]: Without dead ends: 1160 [2024-11-11 20:50:39,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:50:39,276 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 1014 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:39,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 849 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:50:39,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2024-11-11 20:50:39,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1004. [2024-11-11 20:50:39,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 799 states have (on average 1.6045056320400501) internal successors, (1282), 806 states have internal predecessors, (1282), 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-11-11 20:50:39,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1681 transitions. [2024-11-11 20:50:39,356 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1681 transitions. Word has length 109 [2024-11-11 20:50:39,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:39,357 INFO L471 AbstractCegarLoop]: Abstraction has 1004 states and 1681 transitions. [2024-11-11 20:50:39,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:50:39,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1681 transitions. [2024-11-11 20:50:39,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-11 20:50:39,361 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:39,362 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:39,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:50:39,362 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:39,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:39,363 INFO L85 PathProgramCache]: Analyzing trace with hash 2033055594, now seen corresponding path program 1 times [2024-11-11 20:50:39,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:39,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147159377] [2024-11-11 20:50:39,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:39,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:39,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:39,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:39,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:39,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:39,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:39,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:50:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:39,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:50:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:39,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:50:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:39,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:50:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:39,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:50:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:39,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:50:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:39,461 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:50:39,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:39,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147159377] [2024-11-11 20:50:39,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147159377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:39,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:39,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:50:39,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203770030] [2024-11-11 20:50:39,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:39,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:50:39,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:39,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:50:39,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:50:39,463 INFO L87 Difference]: Start difference. First operand 1004 states and 1681 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:50:40,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:40,757 INFO L93 Difference]: Finished difference Result 2551 states and 4313 transitions. [2024-11-11 20:50:40,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:50:40,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2024-11-11 20:50:40,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:40,769 INFO L225 Difference]: With dead ends: 2551 [2024-11-11 20:50:40,769 INFO L226 Difference]: Without dead ends: 1668 [2024-11-11 20:50:40,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:50:40,774 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 1012 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:40,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 812 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:50:40,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2024-11-11 20:50:40,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1512. [2024-11-11 20:50:40,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1212 states have (on average 1.6113861386138615) internal successors, (1953), 1219 states have internal predecessors, (1953), 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-11-11 20:50:40,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2542 transitions. [2024-11-11 20:50:40,860 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2542 transitions. Word has length 110 [2024-11-11 20:50:40,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:40,861 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 2542 transitions. [2024-11-11 20:50:40,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:50:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2542 transitions. [2024-11-11 20:50:40,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 20:50:40,868 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:40,868 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:40,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:50:40,868 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:40,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:40,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1439293862, now seen corresponding path program 1 times [2024-11-11 20:50:40,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:40,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195344694] [2024-11-11 20:50:40,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:40,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:40,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:40,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:40,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:40,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:40,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:40,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:50:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:40,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:50:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:40,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:50:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:40,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:50:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:40,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:50:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:40,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:50:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:50:40,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:40,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195344694] [2024-11-11 20:50:40,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195344694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:40,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:40,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:50:40,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178012846] [2024-11-11 20:50:40,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:40,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:50:40,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:40,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:50:40,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:50:40,975 INFO L87 Difference]: Start difference. First operand 1512 states and 2542 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:50:42,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:42,139 INFO L93 Difference]: Finished difference Result 3703 states and 6322 transitions. [2024-11-11 20:50:42,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:50:42,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2024-11-11 20:50:42,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:42,156 INFO L225 Difference]: With dead ends: 3703 [2024-11-11 20:50:42,156 INFO L226 Difference]: Without dead ends: 2437 [2024-11-11 20:50:42,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:50:42,163 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 1010 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:42,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 811 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:50:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2024-11-11 20:50:42,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2281. [2024-11-11 20:50:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2281 states, 1858 states have (on average 1.6167922497308935) internal successors, (3004), 1865 states have internal predecessors, (3004), 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-11-11 20:50:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3855 transitions. [2024-11-11 20:50:42,267 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3855 transitions. Word has length 111 [2024-11-11 20:50:42,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:42,267 INFO L471 AbstractCegarLoop]: Abstraction has 2281 states and 3855 transitions. [2024-11-11 20:50:42,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:50:42,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3855 transitions. [2024-11-11 20:50:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 20:50:42,275 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:42,275 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:42,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 20:50:42,276 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:42,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:42,276 INFO L85 PathProgramCache]: Analyzing trace with hash -497333621, now seen corresponding path program 1 times [2024-11-11 20:50:42,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:42,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889193143] [2024-11-11 20:50:42,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:42,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:50:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:50:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:50:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:50:42,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:50:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:50:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:50:42,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:42,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889193143] [2024-11-11 20:50:42,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889193143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:42,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:42,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:50:42,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166907756] [2024-11-11 20:50:42,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:42,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:50:42,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:42,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:50:42,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:50:42,386 INFO L87 Difference]: Start difference. First operand 2281 states and 3855 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:50:43,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:43,710 INFO L93 Difference]: Finished difference Result 5497 states and 9456 transitions. [2024-11-11 20:50:43,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:50:43,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2024-11-11 20:50:43,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:43,735 INFO L225 Difference]: With dead ends: 5497 [2024-11-11 20:50:43,735 INFO L226 Difference]: Without dead ends: 3666 [2024-11-11 20:50:43,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:50:43,746 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 1008 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:43,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 811 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:50:43,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3666 states. [2024-11-11 20:50:43,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3666 to 3510. [2024-11-11 20:50:43,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3510 states, 2908 states have (on average 1.6200137551581844) internal successors, (4711), 2915 states have internal predecessors, (4711), 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-11-11 20:50:43,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3510 states to 3510 states and 5946 transitions. [2024-11-11 20:50:43,941 INFO L78 Accepts]: Start accepts. Automaton has 3510 states and 5946 transitions. Word has length 112 [2024-11-11 20:50:43,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:43,942 INFO L471 AbstractCegarLoop]: Abstraction has 3510 states and 5946 transitions. [2024-11-11 20:50:43,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:50:43,942 INFO L276 IsEmpty]: Start isEmpty. Operand 3510 states and 5946 transitions. [2024-11-11 20:50:43,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 20:50:43,952 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:43,953 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:43,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:50:43,953 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:43,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:43,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1467419038, now seen corresponding path program 1 times [2024-11-11 20:50:43,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:43,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029884334] [2024-11-11 20:50:43,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:43,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:50:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:50:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:50:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:50:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:50:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:50:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:50:44,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:44,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029884334] [2024-11-11 20:50:44,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029884334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:44,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:44,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:50:44,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828108187] [2024-11-11 20:50:44,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:44,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:50:44,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:44,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:50:44,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:50:44,068 INFO L87 Difference]: Start difference. First operand 3510 states and 5946 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:50:45,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:45,315 INFO L93 Difference]: Finished difference Result 8445 states and 14603 transitions. [2024-11-11 20:50:45,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:50:45,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2024-11-11 20:50:45,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:45,353 INFO L225 Difference]: With dead ends: 8445 [2024-11-11 20:50:45,353 INFO L226 Difference]: Without dead ends: 5697 [2024-11-11 20:50:45,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:50:45,365 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 1006 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:45,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 830 Invalid, 1664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:50:45,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5697 states. [2024-11-11 20:50:45,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5697 to 5541. [2024-11-11 20:50:45,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5541 states, 4563 states have (on average 1.613631382862152) internal successors, (7363), 4570 states have internal predecessors, (7363), 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-11-11 20:50:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5541 states to 5541 states and 9394 transitions. [2024-11-11 20:50:45,610 INFO L78 Accepts]: Start accepts. Automaton has 5541 states and 9394 transitions. Word has length 113 [2024-11-11 20:50:45,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:45,610 INFO L471 AbstractCegarLoop]: Abstraction has 5541 states and 9394 transitions. [2024-11-11 20:50:45,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:50:45,610 INFO L276 IsEmpty]: Start isEmpty. Operand 5541 states and 9394 transitions. [2024-11-11 20:50:45,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-11 20:50:45,622 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:45,622 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:45,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 20:50:45,623 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:45,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:45,623 INFO L85 PathProgramCache]: Analyzing trace with hash -678340145, now seen corresponding path program 1 times [2024-11-11 20:50:45,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:45,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718108659] [2024-11-11 20:50:45,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:45,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:50:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:50:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:50:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:50:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:50:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:50:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:45,734 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:50:45,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:45,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718108659] [2024-11-11 20:50:45,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718108659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:45,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:45,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:50:45,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003582840] [2024-11-11 20:50:45,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:45,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:50:45,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:45,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:50:45,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:50:45,737 INFO L87 Difference]: Start difference. First operand 5541 states and 9394 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:50:47,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:47,131 INFO L93 Difference]: Finished difference Result 13782 states and 23824 transitions. [2024-11-11 20:50:47,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:50:47,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 114 [2024-11-11 20:50:47,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:47,186 INFO L225 Difference]: With dead ends: 13782 [2024-11-11 20:50:47,186 INFO L226 Difference]: Without dead ends: 9380 [2024-11-11 20:50:47,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:50:47,206 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1004 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:47,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 818 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:50:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9380 states. [2024-11-11 20:50:47,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9380 to 9224. [2024-11-11 20:50:47,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9224 states, 7640 states have (on average 1.6111256544502617) internal successors, (12309), 7647 states have internal predecessors, (12309), 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-11-11 20:50:47,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9224 states to 9224 states and 15630 transitions. [2024-11-11 20:50:47,775 INFO L78 Accepts]: Start accepts. Automaton has 9224 states and 15630 transitions. Word has length 114 [2024-11-11 20:50:47,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:47,776 INFO L471 AbstractCegarLoop]: Abstraction has 9224 states and 15630 transitions. [2024-11-11 20:50:47,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:50:47,776 INFO L276 IsEmpty]: Start isEmpty. Operand 9224 states and 15630 transitions. [2024-11-11 20:50:47,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-11 20:50:47,793 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:47,793 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:47,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 20:50:47,794 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:47,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:47,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1860754352, now seen corresponding path program 1 times [2024-11-11 20:50:47,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:47,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590513471] [2024-11-11 20:50:47,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:47,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:50:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:50:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:50:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:50:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:50:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:50:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:50:47,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:47,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590513471] [2024-11-11 20:50:47,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590513471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:47,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:47,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:50:47,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285642886] [2024-11-11 20:50:47,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:47,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:50:47,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:47,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:50:47,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:50:47,906 INFO L87 Difference]: Start difference. First operand 9224 states and 15630 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:50:49,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:49,225 INFO L93 Difference]: Finished difference Result 23966 states and 41370 transitions. [2024-11-11 20:50:49,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:50:49,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115 [2024-11-11 20:50:49,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:49,294 INFO L225 Difference]: With dead ends: 23966 [2024-11-11 20:50:49,295 INFO L226 Difference]: Without dead ends: 16333 [2024-11-11 20:50:49,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:50:49,332 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 1002 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:49,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 884 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:50:49,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16333 states. [2024-11-11 20:50:50,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16333 to 16177. [2024-11-11 20:50:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16177 states, 13390 states have (on average 1.6020164301717699) internal successors, (21451), 13397 states have internal predecessors, (21451), 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-11-11 20:50:50,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16177 states to 16177 states and 27322 transitions. [2024-11-11 20:50:50,261 INFO L78 Accepts]: Start accepts. Automaton has 16177 states and 27322 transitions. Word has length 115 [2024-11-11 20:50:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:50,262 INFO L471 AbstractCegarLoop]: Abstraction has 16177 states and 27322 transitions. [2024-11-11 20:50:50,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:50:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 16177 states and 27322 transitions. [2024-11-11 20:50:50,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-11 20:50:50,290 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:50,290 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:50,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 20:50:50,291 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:50,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:50,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1941197296, now seen corresponding path program 1 times [2024-11-11 20:50:50,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:50,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962117073] [2024-11-11 20:50:50,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:50,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:50,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:50,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:50,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:50,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:50,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:50,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:50:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:50,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:50:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:50,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:50:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:50,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:50:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:50,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:50:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:50,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:50:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:50,459 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:50:50,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:50,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962117073] [2024-11-11 20:50:50,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962117073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:50,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:50,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:50:50,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886115333] [2024-11-11 20:50:50,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:50,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:50:50,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:50,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:50:50,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:50:50,463 INFO L87 Difference]: Start difference. First operand 16177 states and 27322 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:50:52,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:52,304 INFO L93 Difference]: Finished difference Result 42932 states and 73969 transitions. [2024-11-11 20:50:52,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:50:52,304 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2024-11-11 20:50:52,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:52,441 INFO L225 Difference]: With dead ends: 42932 [2024-11-11 20:50:52,441 INFO L226 Difference]: Without dead ends: 28988 [2024-11-11 20:50:52,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:50:52,498 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 1000 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:52,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 812 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:50:52,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28988 states. [2024-11-11 20:50:53,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28988 to 28832. [2024-11-11 20:50:53,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28832 states, 24006 states have (on average 1.597725568607848) internal successors, (38355), 24013 states have internal predecessors, (38355), 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-11-11 20:50:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28832 states to 28832 states and 48578 transitions. [2024-11-11 20:50:53,754 INFO L78 Accepts]: Start accepts. Automaton has 28832 states and 48578 transitions. Word has length 116 [2024-11-11 20:50:53,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:53,754 INFO L471 AbstractCegarLoop]: Abstraction has 28832 states and 48578 transitions. [2024-11-11 20:50:53,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:50:53,755 INFO L276 IsEmpty]: Start isEmpty. Operand 28832 states and 48578 transitions. [2024-11-11 20:50:53,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-11 20:50:53,790 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:53,790 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:53,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 20:50:53,791 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:53,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:53,791 INFO L85 PathProgramCache]: Analyzing trace with hash -732373582, now seen corresponding path program 1 times [2024-11-11 20:50:53,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:53,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955704694] [2024-11-11 20:50:53,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:53,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:53,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:53,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:53,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:53,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:53,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:53,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:50:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:53,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:50:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:53,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:50:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:53,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:50:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:53,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:50:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:53,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:50:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:53,894 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:50:53,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:53,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955704694] [2024-11-11 20:50:53,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955704694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:53,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:53,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:50:53,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413673026] [2024-11-11 20:50:53,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:53,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:50:53,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:53,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:50:53,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:50:53,897 INFO L87 Difference]: Start difference. First operand 28832 states and 48578 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:50:56,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:56,311 INFO L93 Difference]: Finished difference Result 78694 states and 134728 transitions. [2024-11-11 20:50:56,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:50:56,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 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 117 [2024-11-11 20:50:56,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:56,531 INFO L225 Difference]: With dead ends: 78694 [2024-11-11 20:50:56,531 INFO L226 Difference]: Without dead ends: 52867 [2024-11-11 20:50:56,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:50:56,601 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 998 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:56,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 849 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:50:56,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52867 states. [2024-11-11 20:50:58,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52867 to 52711. [2024-11-11 20:50:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52711 states, 44170 states have (on average 1.5921213493321258) internal successors, (70324), 44177 states have internal predecessors, (70324), 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-11-11 20:50:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52711 states to 52711 states and 88509 transitions. [2024-11-11 20:50:59,209 INFO L78 Accepts]: Start accepts. Automaton has 52711 states and 88509 transitions. Word has length 117 [2024-11-11 20:50:59,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:59,210 INFO L471 AbstractCegarLoop]: Abstraction has 52711 states and 88509 transitions. [2024-11-11 20:50:59,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:50:59,210 INFO L276 IsEmpty]: Start isEmpty. Operand 52711 states and 88509 transitions. [2024-11-11 20:50:59,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-11 20:50:59,236 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:59,237 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:59,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 20:50:59,237 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:59,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:59,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1116888912, now seen corresponding path program 1 times [2024-11-11 20:50:59,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:59,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22100390] [2024-11-11 20:50:59,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:59,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:59,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:59,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:59,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:59,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:59,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:59,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:50:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:59,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:50:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:59,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:50:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:59,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:50:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:59,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:50:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:59,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:50:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:59,343 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:50:59,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:59,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22100390] [2024-11-11 20:50:59,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22100390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:59,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:59,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:50:59,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539610981] [2024-11-11 20:50:59,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:59,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:50:59,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:59,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:50:59,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:50:59,346 INFO L87 Difference]: Start difference. First operand 52711 states and 88509 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:51:02,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:51:02,644 INFO L93 Difference]: Finished difference Result 98465 states and 168915 transitions. [2024-11-11 20:51:02,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:51:02,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 118 [2024-11-11 20:51:02,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:51:03,126 INFO L225 Difference]: With dead ends: 98465 [2024-11-11 20:51:03,126 INFO L226 Difference]: Without dead ends: 98326 [2024-11-11 20:51:03,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:51:03,185 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 993 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:51:03,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 852 Invalid, 1657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 20:51:03,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98326 states. [2024-11-11 20:51:06,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98326 to 98170. [2024-11-11 20:51:06,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98170 states, 82830 states have (on average 1.5851020161777134) internal successors, (131294), 82837 states have internal predecessors, (131294), 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-11-11 20:51:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98170 states to 98170 states and 164123 transitions. [2024-11-11 20:51:06,933 INFO L78 Accepts]: Start accepts. Automaton has 98170 states and 164123 transitions. Word has length 118 [2024-11-11 20:51:06,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:51:06,934 INFO L471 AbstractCegarLoop]: Abstraction has 98170 states and 164123 transitions. [2024-11-11 20:51:06,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:51:06,934 INFO L276 IsEmpty]: Start isEmpty. Operand 98170 states and 164123 transitions. [2024-11-11 20:51:06,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-11 20:51:06,958 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:51:06,958 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:51:06,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 20:51:06,958 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:51:06,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:51:06,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2090243313, now seen corresponding path program 1 times [2024-11-11 20:51:06,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:51:06,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944980520] [2024-11-11 20:51:06,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:51:06,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:51:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:07,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:51:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:07,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:51:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:07,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:51:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:07,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:51:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:07,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:51:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:07,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:51:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:07,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:51:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:07,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:51:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:07,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:51:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:07,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:51:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:07,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:51:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:07,310 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:51:07,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:51:07,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944980520] [2024-11-11 20:51:07,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944980520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:51:07,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:51:07,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-11 20:51:07,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50503246] [2024-11-11 20:51:07,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:51:07,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 20:51:07,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:51:07,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 20:51:07,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2024-11-11 20:51:07,312 INFO L87 Difference]: Start difference. First operand 98170 states and 164123 transitions. Second operand has 16 states, 15 states have (on average 5.466666666666667) internal successors, (82), 10 states have internal predecessors, (82), 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-11-11 20:51:16,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:51:16,343 INFO L93 Difference]: Finished difference Result 196073 states and 339717 transitions. [2024-11-11 20:51:16,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-11 20:51:16,344 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.466666666666667) internal successors, (82), 10 states have internal predecessors, (82), 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 119 [2024-11-11 20:51:16,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:51:17,686 INFO L225 Difference]: With dead ends: 196073 [2024-11-11 20:51:17,686 INFO L226 Difference]: Without dead ends: 195940 [2024-11-11 20:51:17,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=715, Invalid=2825, Unknown=0, NotChecked=0, Total=3540 [2024-11-11 20:51:17,786 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 3709 mSDsluCounter, 2395 mSDsCounter, 0 mSdLazyCounter, 6063 mSolverCounterSat, 1164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3709 SdHoareTripleChecker+Valid, 2628 SdHoareTripleChecker+Invalid, 7227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1164 IncrementalHoareTripleChecker+Valid, 6063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:51:17,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3709 Valid, 2628 Invalid, 7227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1164 Valid, 6063 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-11 20:51:17,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195940 states. [2024-11-11 20:51:24,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195940 to 195512. [2024-11-11 20:51:24,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195512 states, 165032 states have (on average 1.5858984924135926) internal successors, (261724), 164935 states have internal predecessors, (261724), 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-11-11 20:51:25,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195512 states to 195512 states and 330241 transitions. [2024-11-11 20:51:25,303 INFO L78 Accepts]: Start accepts. Automaton has 195512 states and 330241 transitions. Word has length 119 [2024-11-11 20:51:25,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:51:25,303 INFO L471 AbstractCegarLoop]: Abstraction has 195512 states and 330241 transitions. [2024-11-11 20:51:25,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.466666666666667) internal successors, (82), 10 states have internal predecessors, (82), 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-11-11 20:51:25,303 INFO L276 IsEmpty]: Start isEmpty. Operand 195512 states and 330241 transitions. [2024-11-11 20:51:25,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-11 20:51:25,345 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:51:25,346 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:51:25,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 20:51:25,346 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:51:25,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:51:25,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1622170436, now seen corresponding path program 1 times [2024-11-11 20:51:25,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:51:25,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696208391] [2024-11-11 20:51:25,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:51:25,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:51:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:26,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:51:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:26,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:51:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:26,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:51:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:26,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:51:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:26,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:51:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:26,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:51:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:26,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:51:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:26,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:51:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:26,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:51:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:26,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:51:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:26,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:51:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:51:26,459 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:51:26,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:51:26,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696208391] [2024-11-11 20:51:26,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696208391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:51:26,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:51:26,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:51:26,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102957918] [2024-11-11 20:51:26,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:51:26,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:51:26,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:51:26,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:51:26,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:51:26,462 INFO L87 Difference]: Start difference. First operand 195512 states and 330241 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 6 states have internal predecessors, (83), 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)