./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product16.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product16.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 47500ba035fb95802358be3af8dbcb0499051de1fc18562b910c6b7689271057 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:55:34,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:55:34,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:55:34,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:55:34,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:55:34,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:55:34,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:55:34,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:55:34,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:55:34,566 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:55:34,567 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:55:34,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:55:34,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:55:34,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:55:34,568 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:55:34,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:55:34,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:55:34,569 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:55:34,569 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:55:34,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:55:34,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:55:34,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:55:34,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:55:34,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:55:34,571 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:55:34,571 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:55:34,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:55:34,571 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:55:34,572 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:55:34,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:55:34,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:55:34,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:55:34,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:55:34,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:55:34,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:55:34,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:55:34,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:55:34,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:55:34,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:55:34,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:55:34,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:55:34,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:55:34,575 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 47500ba035fb95802358be3af8dbcb0499051de1fc18562b910c6b7689271057 [2024-10-11 02:55:34,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:55:34,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:55:34,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:55:34,847 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:55:34,848 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:55:34,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product16.cil.c [2024-10-11 02:55:36,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:55:36,512 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:55:36,513 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product16.cil.c [2024-10-11 02:55:36,533 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6da3852eb/823b49b8b50e462a830221a18ab37212/FLAGaa5094d90 [2024-10-11 02:55:36,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6da3852eb/823b49b8b50e462a830221a18ab37212 [2024-10-11 02:55:36,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:55:36,840 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:55:36,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:55:36,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:55:36,846 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:55:36,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:55:36" (1/1) ... [2024-10-11 02:55:36,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7620aaf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:36, skipping insertion in model container [2024-10-11 02:55:36,848 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:55:36" (1/1) ... [2024-10-11 02:55:36,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:55:37,226 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product16.cil.c[33283,33296] [2024-10-11 02:55:37,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:55:37,338 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:55:37,346 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [48] [2024-10-11 02:55:37,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [105] [2024-10-11 02:55:37,349 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [216] [2024-10-11 02:55:37,349 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [233] [2024-10-11 02:55:37,349 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [599] [2024-10-11 02:55:37,350 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1004] [2024-10-11 02:55:37,350 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1278] [2024-10-11 02:55:37,350 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1316] [2024-10-11 02:55:37,350 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1541] [2024-10-11 02:55:37,350 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1550] [2024-10-11 02:55:37,354 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1832] [2024-10-11 02:55:37,489 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product16.cil.c[33283,33296] [2024-10-11 02:55:37,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:55:37,596 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:55:37,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:37 WrapperNode [2024-10-11 02:55:37,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:55:37,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:55:37,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:55:37,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:55:37,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:37" (1/1) ... [2024-10-11 02:55:37,632 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:37" (1/1) ... [2024-10-11 02:55:37,683 INFO L138 Inliner]: procedures = 126, calls = 185, calls flagged for inlining = 57, calls inlined = 52, statements flattened = 1003 [2024-10-11 02:55:37,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:55:37,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:55:37,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:55:37,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:55:37,696 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:37" (1/1) ... [2024-10-11 02:55:37,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:37" (1/1) ... [2024-10-11 02:55:37,701 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:37" (1/1) ... [2024-10-11 02:55:37,732 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-10-11 02:55:37,733 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:37" (1/1) ... [2024-10-11 02:55:37,733 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:37" (1/1) ... [2024-10-11 02:55:37,748 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:37" (1/1) ... [2024-10-11 02:55:37,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:37" (1/1) ... [2024-10-11 02:55:37,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:37" (1/1) ... [2024-10-11 02:55:37,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:37" (1/1) ... [2024-10-11 02:55:37,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:55:37,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:55:37,778 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:55:37,778 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:55:37,779 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:37" (1/1) ... [2024-10-11 02:55:37,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:55:37,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:55:37,830 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:55:37,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:55:37,872 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-10-11 02:55:37,872 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-10-11 02:55:37,873 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-10-11 02:55:37,873 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-10-11 02:55:37,873 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-11 02:55:37,873 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-11 02:55:37,873 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-11 02:55:37,874 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-11 02:55:37,874 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-11 02:55:37,874 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-11 02:55:37,874 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-10-11 02:55:37,875 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-10-11 02:55:37,875 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-11 02:55:37,875 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-11 02:55:37,875 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-11 02:55:37,875 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-11 02:55:37,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:55:37,875 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-11 02:55:37,875 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-11 02:55:37,875 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-11 02:55:37,876 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-11 02:55:37,876 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-11 02:55:37,876 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-11 02:55:37,876 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-11 02:55:37,876 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-11 02:55:37,876 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-10-11 02:55:37,876 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-10-11 02:55:37,876 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-11 02:55:37,877 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-11 02:55:37,877 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-11 02:55:37,877 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-11 02:55:37,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:55:37,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:55:37,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:55:37,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:55:37,877 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-11 02:55:37,877 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-11 02:55:37,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:55:37,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:55:38,014 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:55:38,018 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:55:38,618 INFO L? ?]: Removed 417 outVars from TransFormulas that were not future-live. [2024-10-11 02:55:38,618 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:55:38,724 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:55:38,724 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:55:38,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:55:38 BoogieIcfgContainer [2024-10-11 02:55:38,725 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:55:38,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:55:38,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:55:38,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:55:38,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:55:36" (1/3) ... [2024-10-11 02:55:38,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3475a448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:55:38, skipping insertion in model container [2024-10-11 02:55:38,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:37" (2/3) ... [2024-10-11 02:55:38,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3475a448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:55:38, skipping insertion in model container [2024-10-11 02:55:38,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:55:38" (3/3) ... [2024-10-11 02:55:38,732 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec9_product16.cil.c [2024-10-11 02:55:38,746 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:55:38,746 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:55:38,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:55:38,820 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;@19861455, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:55:38,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:55:38,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 271 states, 208 states have (on average 1.6057692307692308) internal successors, (334), 212 states have internal predecessors, (334), 45 states have call successors, (45), 16 states have call predecessors, (45), 16 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 02:55:38,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 02:55:38,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:38,850 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:38,851 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:38,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:38,857 INFO L85 PathProgramCache]: Analyzing trace with hash 453579907, now seen corresponding path program 1 times [2024-10-11 02:55:38,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:38,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366821280] [2024-10-11 02:55:38,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:38,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:39,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:39,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:39,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:39,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:55:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:39,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:55:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:39,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:55:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:39,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:55:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:39,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:55:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:39,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:55:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:39,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:55:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:39,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:55:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:39,483 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:55:39,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:39,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366821280] [2024-10-11 02:55:39,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366821280] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:55:39,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638894495] [2024-10-11 02:55:39,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:39,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:55:39,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:55:39,487 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:55:39,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:55:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:39,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 02:55:39,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:55:39,747 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:55:39,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:55:39,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638894495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:39,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:55:39,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-11 02:55:39,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319504312] [2024-10-11 02:55:39,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:39,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:55:39,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:39,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:55:39,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:55:39,777 INFO L87 Difference]: Start difference. First operand has 271 states, 208 states have (on average 1.6057692307692308) internal successors, (334), 212 states have internal predecessors, (334), 45 states have call successors, (45), 16 states have call predecessors, (45), 16 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:55:39,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:39,860 INFO L93 Difference]: Finished difference Result 397 states and 611 transitions. [2024-10-11 02:55:39,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:55:39,867 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 83 [2024-10-11 02:55:39,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:39,885 INFO L225 Difference]: With dead ends: 397 [2024-10-11 02:55:39,885 INFO L226 Difference]: Without dead ends: 268 [2024-10-11 02:55:39,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:55:39,895 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:39,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 405 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:55:39,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-11 02:55:39,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-10-11 02:55:39,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 206 states have (on average 1.587378640776699) internal successors, (327), 209 states have internal predecessors, (327), 45 states have call successors, (45), 16 states have call predecessors, (45), 16 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 02:55:39,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 416 transitions. [2024-10-11 02:55:39,963 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 416 transitions. Word has length 83 [2024-10-11 02:55:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:39,964 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 416 transitions. [2024-10-11 02:55:39,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:55:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 416 transitions. [2024-10-11 02:55:39,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 02:55:39,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:39,968 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:39,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 02:55:40,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-11 02:55:40,170 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:40,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:40,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1848905278, now seen corresponding path program 1 times [2024-10-11 02:55:40,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:40,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038314077] [2024-10-11 02:55:40,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:40,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:40,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:40,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:40,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:40,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:55:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:40,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:55:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:40,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:55:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:40,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:55:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:40,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:55:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:40,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:55:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:40,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:55:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:40,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:55:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:40,417 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:55:40,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:40,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038314077] [2024-10-11 02:55:40,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038314077] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:55:40,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618420434] [2024-10-11 02:55:40,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:40,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:55:40,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:55:40,421 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:55:40,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:55:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:40,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:55:40,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:55:40,649 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:55:40,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:55:40,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618420434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:40,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:55:40,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:55:40,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609184065] [2024-10-11 02:55:40,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:40,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:55:40,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:40,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:55:40,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:55:40,652 INFO L87 Difference]: Start difference. First operand 268 states and 416 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:55:40,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:40,713 INFO L93 Difference]: Finished difference Result 393 states and 598 transitions. [2024-10-11 02:55:40,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:55:40,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 84 [2024-10-11 02:55:40,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:40,715 INFO L225 Difference]: With dead ends: 393 [2024-10-11 02:55:40,715 INFO L226 Difference]: Without dead ends: 270 [2024-10-11 02:55:40,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:55:40,724 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 0 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:40,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 803 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:55:40,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-11 02:55:40,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2024-10-11 02:55:40,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 208 states have (on average 1.5817307692307692) internal successors, (329), 211 states have internal predecessors, (329), 45 states have call successors, (45), 16 states have call predecessors, (45), 16 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 02:55:40,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 418 transitions. [2024-10-11 02:55:40,761 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 418 transitions. Word has length 84 [2024-10-11 02:55:40,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:40,762 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 418 transitions. [2024-10-11 02:55:40,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:55:40,762 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 418 transitions. [2024-10-11 02:55:40,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 02:55:40,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:40,775 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:40,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 02:55:40,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:55:40,976 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:40,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:40,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1526686467, now seen corresponding path program 1 times [2024-10-11 02:55:40,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:40,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076598641] [2024-10-11 02:55:40,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:40,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:41,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:41,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:41,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:41,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:55:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:41,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:55:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:41,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:55:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:41,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:55:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:41,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:55:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:41,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:55:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:41,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:55:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:41,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:55:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:41,342 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:55:41,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:41,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076598641] [2024-10-11 02:55:41,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076598641] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:55:41,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692425889] [2024-10-11 02:55:41,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:41,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:55:41,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:55:41,345 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:55:41,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:55:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:41,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:55:41,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:55:41,604 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:55:41,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:55:41,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692425889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:41,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:55:41,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:55:41,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032523382] [2024-10-11 02:55:41,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:41,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:55:41,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:41,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:55:41,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:55:41,607 INFO L87 Difference]: Start difference. First operand 270 states and 418 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:55:41,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:41,663 INFO L93 Difference]: Finished difference Result 570 states and 895 transitions. [2024-10-11 02:55:41,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:55:41,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2024-10-11 02:55:41,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:41,666 INFO L225 Difference]: With dead ends: 570 [2024-10-11 02:55:41,666 INFO L226 Difference]: Without dead ends: 322 [2024-10-11 02:55:41,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:55:41,668 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 102 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:41,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 774 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:55:41,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-11 02:55:41,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 317. [2024-10-11 02:55:41,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 244 states have (on average 1.5942622950819672) internal successors, (389), 247 states have internal predecessors, (389), 56 states have call successors, (56), 16 states have call predecessors, (56), 16 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-11 02:55:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 500 transitions. [2024-10-11 02:55:41,686 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 500 transitions. Word has length 89 [2024-10-11 02:55:41,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:41,687 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 500 transitions. [2024-10-11 02:55:41,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:55:41,687 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 500 transitions. [2024-10-11 02:55:41,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 02:55:41,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:41,689 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:41,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 02:55:41,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:55:41,890 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:41,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:41,891 INFO L85 PathProgramCache]: Analyzing trace with hash 860040952, now seen corresponding path program 1 times [2024-10-11 02:55:41,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:41,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365572390] [2024-10-11 02:55:41,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:41,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:41,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:55:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:55:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:55:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:55:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:55:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:55:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:55:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:55:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:55:42,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:42,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365572390] [2024-10-11 02:55:42,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365572390] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:55:42,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599295851] [2024-10-11 02:55:42,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:42,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:55:42,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:55:42,066 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:55:42,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 02:55:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 02:55:42,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:55:42,337 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 02:55:42,337 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:55:42,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599295851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:42,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:55:42,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-11 02:55:42,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001087645] [2024-10-11 02:55:42,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:42,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:55:42,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:42,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:55:42,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:55:42,340 INFO L87 Difference]: Start difference. First operand 317 states and 500 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:55:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:42,422 INFO L93 Difference]: Finished difference Result 629 states and 994 transitions. [2024-10-11 02:55:42,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:55:42,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2024-10-11 02:55:42,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:42,425 INFO L225 Difference]: With dead ends: 629 [2024-10-11 02:55:42,425 INFO L226 Difference]: Without dead ends: 319 [2024-10-11 02:55:42,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:55:42,427 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 2 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:42,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1565 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:55:42,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-11 02:55:42,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2024-10-11 02:55:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 245 states have (on average 1.5918367346938775) internal successors, (390), 249 states have internal predecessors, (390), 56 states have call successors, (56), 16 states have call predecessors, (56), 17 states have return successors, (57), 55 states have call predecessors, (57), 55 states have call successors, (57) [2024-10-11 02:55:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 503 transitions. [2024-10-11 02:55:42,448 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 503 transitions. Word has length 90 [2024-10-11 02:55:42,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:42,448 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 503 transitions. [2024-10-11 02:55:42,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:55:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 503 transitions. [2024-10-11 02:55:42,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 02:55:42,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:42,450 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:42,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 02:55:42,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:55:42,651 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:42,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:42,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1027149010, now seen corresponding path program 1 times [2024-10-11 02:55:42,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:42,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159840185] [2024-10-11 02:55:42,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:42,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:55:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:55:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:55:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:55:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:55:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:55:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:55:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:55:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:55:42,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:42,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159840185] [2024-10-11 02:55:42,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159840185] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:55:42,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721341443] [2024-10-11 02:55:42,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:42,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:55:42,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:55:42,860 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:55:42,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 02:55:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 02:55:43,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:55:43,124 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 02:55:43,124 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:55:43,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721341443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:43,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:55:43,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-11 02:55:43,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460933862] [2024-10-11 02:55:43,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:43,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:55:43,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:43,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:55:43,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:55:43,129 INFO L87 Difference]: Start difference. First operand 319 states and 503 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:55:43,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:43,209 INFO L93 Difference]: Finished difference Result 631 states and 999 transitions. [2024-10-11 02:55:43,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:55:43,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 91 [2024-10-11 02:55:43,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:43,212 INFO L225 Difference]: With dead ends: 631 [2024-10-11 02:55:43,212 INFO L226 Difference]: Without dead ends: 321 [2024-10-11 02:55:43,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:55:43,217 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 2 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1551 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:43,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1551 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:55:43,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-11 02:55:43,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2024-10-11 02:55:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 246 states have (on average 1.589430894308943) internal successors, (391), 251 states have internal predecessors, (391), 56 states have call successors, (56), 16 states have call predecessors, (56), 18 states have return successors, (62), 55 states have call predecessors, (62), 55 states have call successors, (62) [2024-10-11 02:55:43,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 509 transitions. [2024-10-11 02:55:43,241 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 509 transitions. Word has length 91 [2024-10-11 02:55:43,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:43,241 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 509 transitions. [2024-10-11 02:55:43,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:55:43,245 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 509 transitions. [2024-10-11 02:55:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 02:55:43,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:43,247 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:43,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 02:55:43,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:55:43,448 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:43,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:43,448 INFO L85 PathProgramCache]: Analyzing trace with hash -45708592, now seen corresponding path program 1 times [2024-10-11 02:55:43,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:43,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942397244] [2024-10-11 02:55:43,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:43,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:55:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:55:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:55:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:55:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:55:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:55:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:55:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:55:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:43,686 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:55:43,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:43,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942397244] [2024-10-11 02:55:43,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942397244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:43,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:55:43,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:55:43,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586065486] [2024-10-11 02:55:43,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:43,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:55:43,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:43,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:55:43,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:55:43,688 INFO L87 Difference]: Start difference. First operand 321 states and 509 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:55:45,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:45,092 INFO L93 Difference]: Finished difference Result 738 states and 1180 transitions. [2024-10-11 02:55:45,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:55:45,092 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 92 [2024-10-11 02:55:45,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:45,095 INFO L225 Difference]: With dead ends: 738 [2024-10-11 02:55:45,095 INFO L226 Difference]: Without dead ends: 436 [2024-10-11 02:55:45,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:55:45,097 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 850 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2155 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 2426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 2155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:45,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 968 Invalid, 2426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 2155 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:55:45,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-10-11 02:55:45,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 321. [2024-10-11 02:55:45,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 246 states have (on average 1.589430894308943) internal successors, (391), 251 states have internal predecessors, (391), 56 states have call successors, (56), 16 states have call predecessors, (56), 18 states have return successors, (61), 55 states have call predecessors, (61), 55 states have call successors, (61) [2024-10-11 02:55:45,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 508 transitions. [2024-10-11 02:55:45,116 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 508 transitions. Word has length 92 [2024-10-11 02:55:45,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:45,117 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 508 transitions. [2024-10-11 02:55:45,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:55:45,117 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 508 transitions. [2024-10-11 02:55:45,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 02:55:45,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:45,118 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:45,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:55:45,119 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:45,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:45,119 INFO L85 PathProgramCache]: Analyzing trace with hash 136611688, now seen corresponding path program 2 times [2024-10-11 02:55:45,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:45,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287652006] [2024-10-11 02:55:45,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:45,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:55:45,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:55:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:55:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:55:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:55:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:55:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:55:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:55:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:45,250 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:55:45,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:45,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287652006] [2024-10-11 02:55:45,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287652006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:45,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:55:45,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:55:45,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113780279] [2024-10-11 02:55:45,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:45,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:55:45,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:45,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:55:45,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:55:45,252 INFO L87 Difference]: Start difference. First operand 321 states and 508 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:55:47,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:47,067 INFO L93 Difference]: Finished difference Result 740 states and 1183 transitions. [2024-10-11 02:55:47,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:55:47,068 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 93 [2024-10-11 02:55:47,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:47,074 INFO L225 Difference]: With dead ends: 740 [2024-10-11 02:55:47,074 INFO L226 Difference]: Without dead ends: 438 [2024-10-11 02:55:47,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:55:47,081 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 846 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 2443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:47,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 968 Invalid, 2443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 02:55:47,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-11 02:55:47,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 323. [2024-10-11 02:55:47,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 247 states have (on average 1.5870445344129556) internal successors, (392), 253 states have internal predecessors, (392), 56 states have call successors, (56), 16 states have call predecessors, (56), 19 states have return successors, (63), 55 states have call predecessors, (63), 55 states have call successors, (63) [2024-10-11 02:55:47,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 511 transitions. [2024-10-11 02:55:47,128 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 511 transitions. Word has length 93 [2024-10-11 02:55:47,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:47,129 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 511 transitions. [2024-10-11 02:55:47,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:55:47,129 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 511 transitions. [2024-10-11 02:55:47,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 02:55:47,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:47,130 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:47,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:55:47,130 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:47,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:47,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1044270059, now seen corresponding path program 1 times [2024-10-11 02:55:47,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:47,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916616293] [2024-10-11 02:55:47,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:47,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:55:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:55:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:55:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:55:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:55:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:55:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:55:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:55:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:47,432 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:55:47,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:47,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916616293] [2024-10-11 02:55:47,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916616293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:47,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:55:47,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:55:47,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351716292] [2024-10-11 02:55:47,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:47,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:55:47,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:47,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:55:47,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:55:47,437 INFO L87 Difference]: Start difference. First operand 323 states and 511 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 02:55:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:49,455 INFO L93 Difference]: Finished difference Result 738 states and 1178 transitions. [2024-10-11 02:55:49,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:55:49,456 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 94 [2024-10-11 02:55:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:49,459 INFO L225 Difference]: With dead ends: 738 [2024-10-11 02:55:49,459 INFO L226 Difference]: Without dead ends: 438 [2024-10-11 02:55:49,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:55:49,460 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 850 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 3569 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 3846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 3569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:49,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 1343 Invalid, 3846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 3569 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 02:55:49,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-11 02:55:49,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 323. [2024-10-11 02:55:49,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 247 states have (on average 1.5870445344129556) internal successors, (392), 253 states have internal predecessors, (392), 56 states have call successors, (56), 16 states have call predecessors, (56), 19 states have return successors, (62), 55 states have call predecessors, (62), 55 states have call successors, (62) [2024-10-11 02:55:49,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 510 transitions. [2024-10-11 02:55:49,483 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 510 transitions. Word has length 94 [2024-10-11 02:55:49,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:49,483 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 510 transitions. [2024-10-11 02:55:49,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 02:55:49,484 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 510 transitions. [2024-10-11 02:55:49,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 02:55:49,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:49,485 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:49,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:55:49,485 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:49,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:49,486 INFO L85 PathProgramCache]: Analyzing trace with hash -218970743, now seen corresponding path program 2 times [2024-10-11 02:55:49,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:49,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753366868] [2024-10-11 02:55:49,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:49,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:49,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:49,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:49,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:49,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:55:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:49,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:55:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:49,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:55:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:49,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:55:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:49,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:55:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:49,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:55:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:49,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:55:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:49,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:55:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:49,652 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:55:49,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:49,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753366868] [2024-10-11 02:55:49,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753366868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:49,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:55:49,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:55:49,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325135087] [2024-10-11 02:55:49,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:49,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:55:49,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:49,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:55:49,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:55:49,653 INFO L87 Difference]: Start difference. First operand 323 states and 510 transitions. Second operand has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 02:55:51,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:51,467 INFO L93 Difference]: Finished difference Result 740 states and 1184 transitions. [2024-10-11 02:55:51,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:55:51,467 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 95 [2024-10-11 02:55:51,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:51,470 INFO L225 Difference]: With dead ends: 740 [2024-10-11 02:55:51,470 INFO L226 Difference]: Without dead ends: 440 [2024-10-11 02:55:51,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:55:51,472 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 846 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 3622 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 3895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 3622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:51,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1344 Invalid, 3895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 3622 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 02:55:51,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-11 02:55:51,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 325. [2024-10-11 02:55:51,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 248 states have (on average 1.5846774193548387) internal successors, (393), 255 states have internal predecessors, (393), 56 states have call successors, (56), 16 states have call predecessors, (56), 20 states have return successors, (67), 55 states have call predecessors, (67), 55 states have call successors, (67) [2024-10-11 02:55:51,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 516 transitions. [2024-10-11 02:55:51,489 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 516 transitions. Word has length 95 [2024-10-11 02:55:51,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:51,489 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 516 transitions. [2024-10-11 02:55:51,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 02:55:51,490 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 516 transitions. [2024-10-11 02:55:51,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 02:55:51,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:51,491 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:51,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:55:51,491 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:51,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:51,492 INFO L85 PathProgramCache]: Analyzing trace with hash -623043066, now seen corresponding path program 1 times [2024-10-11 02:55:51,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:51,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927725265] [2024-10-11 02:55:51,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:51,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:51,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:51,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:51,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:51,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:55:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:51,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:55:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:51,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:55:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:51,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:55:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:51,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:55:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:51,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:55:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:51,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:55:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:51,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:55:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:55:51,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:51,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927725265] [2024-10-11 02:55:51,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927725265] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:55:51,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757263354] [2024-10-11 02:55:51,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:51,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:55:51,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:55:51,593 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:55:51,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 02:55:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:51,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:55:51,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:55:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:55:51,803 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:55:51,859 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:55:51,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757263354] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:55:51,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:55:51,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-10-11 02:55:51,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808838215] [2024-10-11 02:55:51,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:55:51,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:55:51,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:51,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:55:51,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:55:51,862 INFO L87 Difference]: Start difference. First operand 325 states and 516 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:55:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:53,374 INFO L93 Difference]: Finished difference Result 893 states and 1496 transitions. [2024-10-11 02:55:53,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:55:53,374 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 96 [2024-10-11 02:55:53,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:53,378 INFO L225 Difference]: With dead ends: 893 [2024-10-11 02:55:53,379 INFO L226 Difference]: Without dead ends: 770 [2024-10-11 02:55:53,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:55:53,380 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 1145 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 2750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:53,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 1405 Invalid, 2750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 02:55:53,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-10-11 02:55:53,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 640. [2024-10-11 02:55:53,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 499 states have (on average 1.6392785571142285) internal successors, (818), 506 states have internal predecessors, (818), 120 states have call successors, (120), 16 states have call predecessors, (120), 20 states have return successors, (141), 119 states have call predecessors, (141), 119 states have call successors, (141) [2024-10-11 02:55:53,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1079 transitions. [2024-10-11 02:55:53,406 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1079 transitions. Word has length 96 [2024-10-11 02:55:53,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:53,406 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 1079 transitions. [2024-10-11 02:55:53,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:55:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1079 transitions. [2024-10-11 02:55:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 02:55:53,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:53,409 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:53,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 02:55:53,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 02:55:53,614 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:53,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:53,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1829812663, now seen corresponding path program 1 times [2024-10-11 02:55:53,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:53,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531553587] [2024-10-11 02:55:53,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:53,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:55:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:55:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:55:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:55:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:55:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:55:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:55:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:55:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:55:53,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:53,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531553587] [2024-10-11 02:55:53,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531553587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:53,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:55:53,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:55:53,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939679559] [2024-10-11 02:55:53,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:53,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:55:53,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:53,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:55:53,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:55:53,748 INFO L87 Difference]: Start difference. First operand 640 states and 1079 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:55:55,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:55,928 INFO L93 Difference]: Finished difference Result 1652 states and 2845 transitions. [2024-10-11 02:55:55,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:55:55,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2024-10-11 02:55:55,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:55,938 INFO L225 Difference]: With dead ends: 1652 [2024-10-11 02:55:55,938 INFO L226 Difference]: Without dead ends: 1072 [2024-10-11 02:55:55,940 INFO L431 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-10-11 02:55:55,941 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 945 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 960 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 1594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:55,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [960 Valid, 740 Invalid, 1594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 02:55:55,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-10-11 02:55:55,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 952. [2024-10-11 02:55:55,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 747 states have (on average 1.6465863453815262) internal successors, (1230), 754 states have internal predecessors, (1230), 184 states have call successors, (184), 16 states have call predecessors, (184), 20 states have return successors, (215), 183 states have call predecessors, (215), 183 states have call successors, (215) [2024-10-11 02:55:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1629 transitions. [2024-10-11 02:55:55,979 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1629 transitions. Word has length 102 [2024-10-11 02:55:55,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:55,980 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1629 transitions. [2024-10-11 02:55:55,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:55:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1629 transitions. [2024-10-11 02:55:55,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 02:55:55,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:55,984 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:55,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:55:55,984 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:55,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:55,984 INFO L85 PathProgramCache]: Analyzing trace with hash 477458031, now seen corresponding path program 1 times [2024-10-11 02:55:55,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:55,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780662190] [2024-10-11 02:55:55,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:55,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:56,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:56,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:56,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:56,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:55:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:56,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:55:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:56,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:55:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:56,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:55:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:56,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:55:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:56,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:55:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:56,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:55:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:56,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:55:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:56,128 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:55:56,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:56,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780662190] [2024-10-11 02:55:56,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780662190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:56,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:55:56,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:55:56,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388763329] [2024-10-11 02:55:56,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:56,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:55:56,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:56,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:55:56,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:55:56,130 INFO L87 Difference]: Start difference. First operand 952 states and 1629 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:55:57,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:57,209 INFO L93 Difference]: Finished difference Result 2401 states and 4163 transitions. [2024-10-11 02:55:57,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:55:57,210 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-10-11 02:55:57,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:57,217 INFO L225 Difference]: With dead ends: 2401 [2024-10-11 02:55:57,217 INFO L226 Difference]: Without dead ends: 1559 [2024-10-11 02:55:57,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:55:57,220 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 943 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:57,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 710 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:55:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2024-10-11 02:55:57,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1439. [2024-10-11 02:55:57,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1139 states have (on average 1.6505706760316066) internal successors, (1880), 1146 states have internal predecessors, (1880), 279 states have call successors, (279), 16 states have call predecessors, (279), 20 states have return successors, (310), 278 states have call predecessors, (310), 278 states have call successors, (310) [2024-10-11 02:55:57,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 2469 transitions. [2024-10-11 02:55:57,266 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 2469 transitions. Word has length 103 [2024-10-11 02:55:57,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:57,266 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 2469 transitions. [2024-10-11 02:55:57,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:55:57,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 2469 transitions. [2024-10-11 02:55:57,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 02:55:57,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:57,271 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:57,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:55:57,271 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:57,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:57,271 INFO L85 PathProgramCache]: Analyzing trace with hash 493311719, now seen corresponding path program 1 times [2024-10-11 02:55:57,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:57,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350101592] [2024-10-11 02:55:57,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:57,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:57,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:57,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:57,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:57,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:55:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:57,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:55:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:57,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:55:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:57,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:55:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:57,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:55:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:57,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:55:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:57,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:55:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:57,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:55:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:55:57,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:57,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350101592] [2024-10-11 02:55:57,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350101592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:57,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:55:57,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:55:57,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145860540] [2024-10-11 02:55:57,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:57,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:55:57,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:57,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:55:57,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:55:57,345 INFO L87 Difference]: Start difference. First operand 1439 states and 2469 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:55:58,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:58,311 INFO L93 Difference]: Finished difference Result 3503 states and 6122 transitions. [2024-10-11 02:55:58,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:55:58,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-10-11 02:55:58,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:58,321 INFO L225 Difference]: With dead ends: 3503 [2024-10-11 02:55:58,321 INFO L226 Difference]: Without dead ends: 2294 [2024-10-11 02:55:58,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:55:58,325 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 941 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:58,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 708 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 02:55:58,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2294 states. [2024-10-11 02:55:58,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2294 to 2174. [2024-10-11 02:55:58,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2174 states, 1751 states have (on average 1.6544831524842947) internal successors, (2897), 1758 states have internal predecessors, (2897), 402 states have call successors, (402), 16 states have call predecessors, (402), 20 states have return successors, (449), 401 states have call predecessors, (449), 401 states have call successors, (449) [2024-10-11 02:55:58,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 3748 transitions. [2024-10-11 02:55:58,453 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 3748 transitions. Word has length 104 [2024-10-11 02:55:58,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:58,457 INFO L471 AbstractCegarLoop]: Abstraction has 2174 states and 3748 transitions. [2024-10-11 02:55:58,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:55:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 3748 transitions. [2024-10-11 02:55:58,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 02:55:58,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:58,468 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:58,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:55:58,468 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:58,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:58,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1393428050, now seen corresponding path program 1 times [2024-10-11 02:55:58,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:58,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641766433] [2024-10-11 02:55:58,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:58,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:55:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:55:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:55:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:55:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:55:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:55:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:55:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:55:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:58,540 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:55:58,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:58,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641766433] [2024-10-11 02:55:58,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641766433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:58,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:55:58,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:55:58,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878646463] [2024-10-11 02:55:58,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:58,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:55:58,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:58,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:55:58,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:55:58,542 INFO L87 Difference]: Start difference. First operand 2174 states and 3748 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:55:59,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:55:59,595 INFO L93 Difference]: Finished difference Result 5213 states and 9172 transitions. [2024-10-11 02:55:59,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:55:59,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2024-10-11 02:55:59,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:55:59,610 INFO L225 Difference]: With dead ends: 5213 [2024-10-11 02:55:59,610 INFO L226 Difference]: Without dead ends: 3466 [2024-10-11 02:55:59,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:55:59,616 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 939 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:55:59,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 708 Invalid, 1557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:55:59,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3466 states. [2024-10-11 02:55:59,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3466 to 3346. [2024-10-11 02:55:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3346 states, 2744 states have (on average 1.657069970845481) internal successors, (4547), 2751 states have internal predecessors, (4547), 581 states have call successors, (581), 16 states have call predecessors, (581), 20 states have return successors, (654), 580 states have call predecessors, (654), 580 states have call successors, (654) [2024-10-11 02:55:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3346 states to 3346 states and 5782 transitions. [2024-10-11 02:55:59,717 INFO L78 Accepts]: Start accepts. Automaton has 3346 states and 5782 transitions. Word has length 105 [2024-10-11 02:55:59,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:55:59,717 INFO L471 AbstractCegarLoop]: Abstraction has 3346 states and 5782 transitions. [2024-10-11 02:55:59,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:55:59,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3346 states and 5782 transitions. [2024-10-11 02:55:59,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 02:55:59,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:55:59,724 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:55:59,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:55:59,725 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:55:59,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:55:59,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1044137003, now seen corresponding path program 1 times [2024-10-11 02:55:59,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:55:59,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442913061] [2024-10-11 02:55:59,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:55:59,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:55:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:59,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:55:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:59,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:55:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:59,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:55:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:59,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:55:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:59,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:55:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:59,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:55:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:59,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:55:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:59,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:55:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:59,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:55:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:59,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:55:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:59,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:55:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:55:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:55:59,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:55:59,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442913061] [2024-10-11 02:55:59,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442913061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:55:59,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:55:59,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:55:59,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128585452] [2024-10-11 02:55:59,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:55:59,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:55:59,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:55:59,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:55:59,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:55:59,800 INFO L87 Difference]: Start difference. First operand 3346 states and 5782 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:56:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:00,910 INFO L93 Difference]: Finished difference Result 8068 states and 14226 transitions. [2024-10-11 02:56:00,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:00,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2024-10-11 02:56:00,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:00,935 INFO L225 Difference]: With dead ends: 8068 [2024-10-11 02:56:00,935 INFO L226 Difference]: Without dead ends: 5436 [2024-10-11 02:56:00,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:00,944 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 937 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:00,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 747 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:56:00,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5436 states. [2024-10-11 02:56:01,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5436 to 5316. [2024-10-11 02:56:01,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5316 states, 4338 states have (on average 1.6454587367450437) internal successors, (7138), 4345 states have internal predecessors, (7138), 957 states have call successors, (957), 16 states have call predecessors, (957), 20 states have return successors, (1074), 956 states have call predecessors, (1074), 956 states have call successors, (1074) [2024-10-11 02:56:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 9169 transitions. [2024-10-11 02:56:01,180 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 9169 transitions. Word has length 106 [2024-10-11 02:56:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:01,180 INFO L471 AbstractCegarLoop]: Abstraction has 5316 states and 9169 transitions. [2024-10-11 02:56:01,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:56:01,181 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 9169 transitions. [2024-10-11 02:56:01,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 02:56:01,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:01,191 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:01,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:56:01,192 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:01,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:01,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1541707882, now seen corresponding path program 1 times [2024-10-11 02:56:01,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:01,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466366667] [2024-10-11 02:56:01,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:01,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:56:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:56:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:56:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:56:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:56:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:01,264 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:01,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:01,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466366667] [2024-10-11 02:56:01,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466366667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:01,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:01,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:01,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813900156] [2024-10-11 02:56:01,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:01,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:01,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:01,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:01,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:01,265 INFO L87 Difference]: Start difference. First operand 5316 states and 9169 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:56:02,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:02,459 INFO L93 Difference]: Finished difference Result 13205 states and 23247 transitions. [2024-10-11 02:56:02,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:02,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2024-10-11 02:56:02,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:02,499 INFO L225 Difference]: With dead ends: 13205 [2024-10-11 02:56:02,499 INFO L226 Difference]: Without dead ends: 8969 [2024-10-11 02:56:02,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:02,523 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 935 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:02,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 721 Invalid, 1594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 02:56:02,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8969 states. [2024-10-11 02:56:02,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8969 to 8849. [2024-10-11 02:56:02,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8849 states, 7265 states have (on average 1.6426703372333105) internal successors, (11934), 7272 states have internal predecessors, (11934), 1563 states have call successors, (1563), 16 states have call predecessors, (1563), 20 states have return successors, (1758), 1562 states have call predecessors, (1758), 1562 states have call successors, (1758) [2024-10-11 02:56:02,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8849 states to 8849 states and 15255 transitions. [2024-10-11 02:56:02,850 INFO L78 Accepts]: Start accepts. Automaton has 8849 states and 15255 transitions. Word has length 107 [2024-10-11 02:56:02,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:02,850 INFO L471 AbstractCegarLoop]: Abstraction has 8849 states and 15255 transitions. [2024-10-11 02:56:02,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:56:02,850 INFO L276 IsEmpty]: Start isEmpty. Operand 8849 states and 15255 transitions. [2024-10-11 02:56:02,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 02:56:02,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:02,862 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:02,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:56:02,862 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:02,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:02,863 INFO L85 PathProgramCache]: Analyzing trace with hash -209401347, now seen corresponding path program 1 times [2024-10-11 02:56:02,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:02,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157471419] [2024-10-11 02:56:02,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:02,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:02,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:02,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:02,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:02,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:02,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:02,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:02,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:56:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:02,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:56:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:02,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:56:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:02,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:56:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:02,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:56:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:02,935 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:02,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:02,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157471419] [2024-10-11 02:56:02,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157471419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:02,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:02,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:02,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529453493] [2024-10-11 02:56:02,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:02,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:02,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:02,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:02,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:02,936 INFO L87 Difference]: Start difference. First operand 8849 states and 15255 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:56:04,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:04,198 INFO L93 Difference]: Finished difference Result 22977 states and 40381 transitions. [2024-10-11 02:56:04,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:04,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-10-11 02:56:04,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:04,255 INFO L225 Difference]: With dead ends: 22977 [2024-10-11 02:56:04,256 INFO L226 Difference]: Without dead ends: 15641 [2024-10-11 02:56:04,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:04,279 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 933 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:04,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 754 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:56:04,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15641 states. [2024-10-11 02:56:04,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15641 to 15521. [2024-10-11 02:56:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15521 states, 12734 states have (on average 1.633029684309722) internal successors, (20795), 12741 states have internal predecessors, (20795), 2766 states have call successors, (2766), 16 states have call predecessors, (2766), 20 states have return successors, (3105), 2765 states have call predecessors, (3105), 2765 states have call successors, (3105) [2024-10-11 02:56:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15521 states to 15521 states and 26666 transitions. [2024-10-11 02:56:04,857 INFO L78 Accepts]: Start accepts. Automaton has 15521 states and 26666 transitions. Word has length 108 [2024-10-11 02:56:04,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:04,858 INFO L471 AbstractCegarLoop]: Abstraction has 15521 states and 26666 transitions. [2024-10-11 02:56:04,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:56:04,859 INFO L276 IsEmpty]: Start isEmpty. Operand 15521 states and 26666 transitions. [2024-10-11 02:56:04,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 02:56:04,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:04,964 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:04,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 02:56:04,965 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:04,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:04,965 INFO L85 PathProgramCache]: Analyzing trace with hash 26754697, now seen corresponding path program 1 times [2024-10-11 02:56:04,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:04,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802309236] [2024-10-11 02:56:04,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:04,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:56:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:56:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:56:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:56:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:56:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:05,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:05,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802309236] [2024-10-11 02:56:05,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802309236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:05,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:05,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:05,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958536665] [2024-10-11 02:56:05,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:05,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:05,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:05,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:05,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:05,054 INFO L87 Difference]: Start difference. First operand 15521 states and 26666 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:56:06,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:06,482 INFO L93 Difference]: Finished difference Result 41144 states and 72181 transitions. [2024-10-11 02:56:06,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:06,482 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2024-10-11 02:56:06,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:06,598 INFO L225 Difference]: With dead ends: 41144 [2024-10-11 02:56:06,598 INFO L226 Difference]: Without dead ends: 27756 [2024-10-11 02:56:06,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:06,640 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 931 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:06,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 712 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:56:06,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27756 states. [2024-10-11 02:56:07,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27756 to 27636. [2024-10-11 02:56:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27636 states, 22810 states have (on average 1.6290661990355106) internal successors, (37159), 22817 states have internal predecessors, (37159), 4805 states have call successors, (4805), 16 states have call predecessors, (4805), 20 states have return successors, (5418), 4804 states have call predecessors, (5418), 4804 states have call successors, (5418) [2024-10-11 02:56:07,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27636 states to 27636 states and 47382 transitions. [2024-10-11 02:56:07,770 INFO L78 Accepts]: Start accepts. Automaton has 27636 states and 47382 transitions. Word has length 109 [2024-10-11 02:56:07,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:07,770 INFO L471 AbstractCegarLoop]: Abstraction has 27636 states and 47382 transitions. [2024-10-11 02:56:07,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:56:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 27636 states and 47382 transitions. [2024-10-11 02:56:07,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 02:56:07,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:07,795 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:07,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 02:56:07,796 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:07,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:07,796 INFO L85 PathProgramCache]: Analyzing trace with hash -430168613, now seen corresponding path program 1 times [2024-10-11 02:56:07,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:07,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337040128] [2024-10-11 02:56:07,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:07,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:56:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:56:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:56:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:56:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:56:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:07,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:07,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337040128] [2024-10-11 02:56:07,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337040128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:07,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:07,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:07,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19686335] [2024-10-11 02:56:07,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:07,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:07,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:07,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:07,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:07,901 INFO L87 Difference]: Start difference. First operand 27636 states and 47382 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:56:10,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:10,180 INFO L93 Difference]: Finished difference Result 75336 states and 131370 transitions. [2024-10-11 02:56:10,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:10,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2024-10-11 02:56:10,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:10,418 INFO L225 Difference]: With dead ends: 75336 [2024-10-11 02:56:10,419 INFO L226 Difference]: Without dead ends: 50580 [2024-10-11 02:56:10,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:10,493 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 929 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 1575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:10,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 715 Invalid, 1575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:56:10,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50580 states. [2024-10-11 02:56:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50580 to 50460. [2024-10-11 02:56:12,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50460 states, 41919 states have (on average 1.6239175552851928) internal successors, (68073), 41926 states have internal predecessors, (68073), 8520 states have call successors, (8520), 16 states have call predecessors, (8520), 20 states have return successors, (9665), 8519 states have call predecessors, (9665), 8519 states have call successors, (9665) [2024-10-11 02:56:12,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50460 states to 50460 states and 86258 transitions. [2024-10-11 02:56:12,430 INFO L78 Accepts]: Start accepts. Automaton has 50460 states and 86258 transitions. Word has length 110 [2024-10-11 02:56:12,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:12,430 INFO L471 AbstractCegarLoop]: Abstraction has 50460 states and 86258 transitions. [2024-10-11 02:56:12,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:56:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 50460 states and 86258 transitions. [2024-10-11 02:56:12,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 02:56:12,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:12,452 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:12,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 02:56:12,453 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:12,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:12,453 INFO L85 PathProgramCache]: Analyzing trace with hash -437264791, now seen corresponding path program 1 times [2024-10-11 02:56:12,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:12,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420106464] [2024-10-11 02:56:12,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:12,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:56:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:56:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:56:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:56:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:56:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:12,583 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:12,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:12,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420106464] [2024-10-11 02:56:12,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420106464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:12,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:12,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:12,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615845996] [2024-10-11 02:56:12,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:12,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:12,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:12,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:12,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:12,586 INFO L87 Difference]: Start difference. First operand 50460 states and 86258 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:56:15,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:15,567 INFO L93 Difference]: Finished difference Result 94083 states and 164533 transitions. [2024-10-11 02:56:15,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:15,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2024-10-11 02:56:15,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:15,959 INFO L225 Difference]: With dead ends: 94083 [2024-10-11 02:56:15,959 INFO L226 Difference]: Without dead ends: 93960 [2024-10-11 02:56:16,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:16,011 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 924 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:16,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 724 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:56:16,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93960 states. [2024-10-11 02:56:19,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93960 to 93840. [2024-10-11 02:56:19,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93840 states, 78500 states have (on average 1.617375796178344) internal successors, (126964), 78507 states have internal predecessors, (126964), 15319 states have call successors, (15319), 16 states have call predecessors, (15319), 20 states have return successors, (17510), 15318 states have call predecessors, (17510), 15318 states have call successors, (17510) [2024-10-11 02:56:19,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93840 states to 93840 states and 159793 transitions. [2024-10-11 02:56:20,021 INFO L78 Accepts]: Start accepts. Automaton has 93840 states and 159793 transitions. Word has length 111 [2024-10-11 02:56:20,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:20,022 INFO L471 AbstractCegarLoop]: Abstraction has 93840 states and 159793 transitions. [2024-10-11 02:56:20,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:56:20,023 INFO L276 IsEmpty]: Start isEmpty. Operand 93840 states and 159793 transitions. [2024-10-11 02:56:20,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 02:56:20,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:20,056 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:20,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 02:56:20,057 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:20,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:20,057 INFO L85 PathProgramCache]: Analyzing trace with hash 662008892, now seen corresponding path program 1 times [2024-10-11 02:56:20,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:20,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361213334] [2024-10-11 02:56:20,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:20,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:56:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:56:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:56:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:56:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:56:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,489 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:20,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:20,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361213334] [2024-10-11 02:56:20,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361213334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:20,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:20,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-11 02:56:20,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150790597] [2024-10-11 02:56:20,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:20,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 02:56:20,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:20,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 02:56:20,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:56:20,492 INFO L87 Difference]: Start difference. First operand 93840 states and 159793 transitions. Second operand has 16 states, 15 states have (on average 5.0) internal successors, (75), 10 states have internal predecessors, (75), 5 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-11 02:56:29,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:29,222 INFO L93 Difference]: Finished difference Result 187329 states and 330974 transitions. [2024-10-11 02:56:29,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-11 02:56:29,223 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 10 states have internal predecessors, (75), 5 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 112 [2024-10-11 02:56:29,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:30,124 INFO L225 Difference]: With dead ends: 187329 [2024-10-11 02:56:30,124 INFO L226 Difference]: Without dead ends: 187211 [2024-10-11 02:56:30,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=648, Invalid=2544, Unknown=0, NotChecked=0, Total=3192 [2024-10-11 02:56:30,210 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 2966 mSDsluCounter, 2140 mSDsCounter, 0 mSdLazyCounter, 5664 mSolverCounterSat, 976 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2978 SdHoareTripleChecker+Valid, 2352 SdHoareTripleChecker+Invalid, 6640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 976 IncrementalHoareTripleChecker+Valid, 5664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:30,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2978 Valid, 2352 Invalid, 6640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [976 Valid, 5664 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 02:56:30,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187211 states. [2024-10-11 02:56:36,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187211 to 186870. [2024-10-11 02:56:36,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186870 states, 156390 states have (on average 1.6182748257561226) internal successors, (253082), 156293 states have internal predecessors, (253082), 30430 states have call successors, (30430), 41 states have call predecessors, (30430), 49 states have return successors, (38087), 30541 states have call predecessors, (38087), 30427 states have call successors, (38087) [2024-10-11 02:56:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186870 states to 186870 states and 321599 transitions. [2024-10-11 02:56:38,004 INFO L78 Accepts]: Start accepts. Automaton has 186870 states and 321599 transitions. Word has length 112 [2024-10-11 02:56:38,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:38,005 INFO L471 AbstractCegarLoop]: Abstraction has 186870 states and 321599 transitions. [2024-10-11 02:56:38,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 10 states have internal predecessors, (75), 5 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-11 02:56:38,005 INFO L276 IsEmpty]: Start isEmpty. Operand 186870 states and 321599 transitions. [2024-10-11 02:56:38,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 02:56:38,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:38,085 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:38,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 02:56:38,085 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:38,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:38,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1347202769, now seen corresponding path program 1 times [2024-10-11 02:56:38,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:38,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520069989] [2024-10-11 02:56:38,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:38,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:38,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:56:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:56:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:56:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:56:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:56:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,337 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:38,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:38,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520069989] [2024-10-11 02:56:38,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520069989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:38,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:38,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:56:38,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241325025] [2024-10-11 02:56:38,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:38,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:56:38,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:38,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:56:38,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:56:38,339 INFO L87 Difference]: Start difference. First operand 186870 states and 321599 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 6 states have internal predecessors, (76), 4 states have call successors, (13), 7 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 02:56:44,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:44,614 INFO L93 Difference]: Finished difference Result 188030 states and 329918 transitions. [2024-10-11 02:56:44,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 02:56:44,614 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 6 states have internal predecessors, (76), 4 states have call successors, (13), 7 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 113 [2024-10-11 02:56:44,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:45,767 INFO L225 Difference]: With dead ends: 188030 [2024-10-11 02:56:45,768 INFO L226 Difference]: Without dead ends: 187262 [2024-10-11 02:56:45,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2024-10-11 02:56:45,861 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 1864 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1879 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 3322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 608 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:45,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1879 Valid, 1180 Invalid, 3322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [608 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 02:56:45,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187262 states. [2024-10-11 02:56:51,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187262 to 186932. [2024-10-11 02:56:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186932 states, 156437 states have (on average 1.6182041332932746) internal successors, (253147), 156341 states have internal predecessors, (253147), 30445 states have call successors, (30445), 44 states have call predecessors, (30445), 49 states have return successors, (38103), 30555 states have call predecessors, (38103), 30442 states have call successors, (38103) [2024-10-11 02:56:53,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186932 states to 186932 states and 321695 transitions. [2024-10-11 02:56:53,210 INFO L78 Accepts]: Start accepts. Automaton has 186932 states and 321695 transitions. Word has length 113 [2024-10-11 02:56:53,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:53,211 INFO L471 AbstractCegarLoop]: Abstraction has 186932 states and 321695 transitions. [2024-10-11 02:56:53,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 6 states have internal predecessors, (76), 4 states have call successors, (13), 7 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 02:56:53,211 INFO L276 IsEmpty]: Start isEmpty. Operand 186932 states and 321695 transitions. [2024-10-11 02:56:53,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 02:56:53,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:53,249 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:53,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 02:56:53,250 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:53,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:53,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1708467463, now seen corresponding path program 1 times [2024-10-11 02:56:53,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:53,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190572867] [2024-10-11 02:56:53,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:53,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:53,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:53,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:53,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:53,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:53,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:53,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:53,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:56:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:53,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:56:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:53,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:56:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:53,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:56:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:53,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:56:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:53,517 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:53,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:53,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190572867] [2024-10-11 02:56:53,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190572867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:53,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:53,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-11 02:56:53,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024730238] [2024-10-11 02:56:53,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:53,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 02:56:53,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:53,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 02:56:53,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:56:53,519 INFO L87 Difference]: Start difference. First operand 186932 states and 321695 transitions. Second operand has 16 states, 15 states have (on average 5.066666666666666) internal successors, (76), 10 states have internal predecessors, (76), 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)