./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_product12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product12.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d7925e6725ebc9ccc1628dac3a92336bad7d7149419f1b3b2e679ed4e3055d5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 00:56:58,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 00:56:58,442 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 00:56:58,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 00:56:58,448 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 00:56:58,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 00:56:58,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 00:56:58,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 00:56:58,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 00:56:58,471 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 00:56:58,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 00:56:58,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 00:56:58,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 00:56:58,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 00:56:58,473 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 00:56:58,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 00:56:58,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 00:56:58,473 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 00:56:58,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 00:56:58,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 00:56:58,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 00:56:58,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 00:56:58,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 00:56:58,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 00:56:58,478 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 00:56:58,479 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 00:56:58,479 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 00:56:58,479 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 00:56:58,479 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 00:56:58,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 00:56:58,480 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 00:56:58,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 00:56:58,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:56:58,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 00:56:58,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 00:56:58,481 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 00:56:58,481 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 00:56:58,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 00:56:58,482 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 00:56:58,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 00:56:58,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 00:56:58,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 00:56:58,483 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d7925e6725ebc9ccc1628dac3a92336bad7d7149419f1b3b2e679ed4e3055d5 [2024-10-24 00:56:58,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 00:56:58,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 00:56:58,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 00:56:58,716 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 00:56:58,716 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 00:56:58,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product12.cil.c [2024-10-24 00:56:59,926 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 00:57:00,172 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 00:57:00,172 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product12.cil.c [2024-10-24 00:57:00,191 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdaba7876/c65884f3f73b4eee91756fa29ac62a7b/FLAG6b614feb2 [2024-10-24 00:57:00,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdaba7876/c65884f3f73b4eee91756fa29ac62a7b [2024-10-24 00:57:00,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 00:57:00,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 00:57:00,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 00:57:00,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 00:57:00,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 00:57:00,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:57:00" (1/1) ... [2024-10-24 00:57:00,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1652892e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:00, skipping insertion in model container [2024-10-24 00:57:00,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:57:00" (1/1) ... [2024-10-24 00:57:00,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 00:57:00,652 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_product12.cil.c[29763,29776] [2024-10-24 00:57:00,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:57:00,714 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 00:57:00,724 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [48] [2024-10-24 00:57:00,726 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [105] [2024-10-24 00:57:00,726 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [122] [2024-10-24 00:57:00,726 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [160] [2024-10-24 00:57:00,726 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [405] [2024-10-24 00:57:00,727 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [811] [2024-10-24 00:57:00,727 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1091] [2024-10-24 00:57:00,727 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1457] [2024-10-24 00:57:00,727 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1466] [2024-10-24 00:57:00,728 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1570] [2024-10-24 00:57:00,728 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2639] [2024-10-24 00:57:00,772 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_product12.cil.c[29763,29776] [2024-10-24 00:57:00,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:57:00,827 INFO L204 MainTranslator]: Completed translation [2024-10-24 00:57:00,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:00 WrapperNode [2024-10-24 00:57:00,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 00:57:00,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 00:57:00,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 00:57:00,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 00:57:00,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:00" (1/1) ... [2024-10-24 00:57:00,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:00" (1/1) ... [2024-10-24 00:57:00,907 INFO L138 Inliner]: procedures = 123, calls = 177, calls flagged for inlining = 51, calls inlined = 41, statements flattened = 840 [2024-10-24 00:57:00,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 00:57:00,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 00:57:00,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 00:57:00,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 00:57:00,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:00" (1/1) ... [2024-10-24 00:57:00,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:00" (1/1) ... [2024-10-24 00:57:00,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:00" (1/1) ... [2024-10-24 00:57:00,940 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-10-24 00:57:00,940 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:00" (1/1) ... [2024-10-24 00:57:00,940 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:00" (1/1) ... [2024-10-24 00:57:00,960 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:00" (1/1) ... [2024-10-24 00:57:00,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:00" (1/1) ... [2024-10-24 00:57:00,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:00" (1/1) ... [2024-10-24 00:57:00,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:00" (1/1) ... [2024-10-24 00:57:00,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 00:57:00,990 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 00:57:00,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 00:57:00,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 00:57:00,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:00" (1/1) ... [2024-10-24 00:57:00,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:57:01,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:57:01,019 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 00:57:01,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 00:57:01,051 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-10-24 00:57:01,051 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-10-24 00:57:01,051 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-10-24 00:57:01,051 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-10-24 00:57:01,051 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-24 00:57:01,051 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-24 00:57:01,051 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-24 00:57:01,051 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-24 00:57:01,052 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-24 00:57:01,052 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-24 00:57:01,052 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-10-24 00:57:01,052 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-10-24 00:57:01,052 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-24 00:57:01,052 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-24 00:57:01,052 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-24 00:57:01,052 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-24 00:57:01,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 00:57:01,052 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-24 00:57:01,052 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-24 00:57:01,052 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-24 00:57:01,052 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-24 00:57:01,053 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-24 00:57:01,053 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-24 00:57:01,053 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-24 00:57:01,053 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-24 00:57:01,053 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-10-24 00:57:01,053 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-10-24 00:57:01,053 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-24 00:57:01,054 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-24 00:57:01,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 00:57:01,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 00:57:01,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 00:57:01,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 00:57:01,054 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-24 00:57:01,054 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-24 00:57:01,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 00:57:01,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 00:57:01,186 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 00:57:01,188 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 00:57:01,713 INFO L? ?]: Removed 339 outVars from TransFormulas that were not future-live. [2024-10-24 00:57:01,713 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 00:57:01,751 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 00:57:01,751 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 00:57:01,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:57:01 BoogieIcfgContainer [2024-10-24 00:57:01,751 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 00:57:01,753 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 00:57:01,753 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 00:57:01,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 00:57:01,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:57:00" (1/3) ... [2024-10-24 00:57:01,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e55bdfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:57:01, skipping insertion in model container [2024-10-24 00:57:01,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:00" (2/3) ... [2024-10-24 00:57:01,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e55bdfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:57:01, skipping insertion in model container [2024-10-24 00:57:01,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:57:01" (3/3) ... [2024-10-24 00:57:01,758 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec9_product12.cil.c [2024-10-24 00:57:01,770 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 00:57:01,770 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 00:57:01,863 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 00:57:01,869 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;@1c38a3c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 00:57:01,870 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 00:57:01,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 184 states have (on average 1.6195652173913044) internal successors, (298), 188 states have internal predecessors, (298), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 00:57:01,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 00:57:01,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:01,894 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] [2024-10-24 00:57:01,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:01,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:01,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1586924661, now seen corresponding path program 1 times [2024-10-24 00:57:01,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:01,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086275911] [2024-10-24 00:57:01,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:01,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:02,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:02,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:02,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:02,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:57:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:02,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:57:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:02,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:57:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:02,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 00:57:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:02,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 00:57:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:02,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:57:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:02,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:57:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:02,497 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:57:02,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:02,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086275911] [2024-10-24 00:57:02,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086275911] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:57:02,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567627227] [2024-10-24 00:57:02,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:02,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:02,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:57:02,501 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:57:02,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 00:57:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:02,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 00:57:02,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:57:02,753 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:57:02,753 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:57:02,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567627227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:02,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:57:02,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-10-24 00:57:02,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645797938] [2024-10-24 00:57:02,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:02,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 00:57:02,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:02,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 00:57:02,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 00:57:02,783 INFO L87 Difference]: Start difference. First operand has 240 states, 184 states have (on average 1.6195652173913044) internal successors, (298), 188 states have internal predecessors, (298), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:02,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:02,849 INFO L93 Difference]: Finished difference Result 339 states and 522 transitions. [2024-10-24 00:57:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 00:57:02,851 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 80 [2024-10-24 00:57:02,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:02,864 INFO L225 Difference]: With dead ends: 339 [2024-10-24 00:57:02,864 INFO L226 Difference]: Without dead ends: 237 [2024-10-24 00:57:02,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 00:57:02,874 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:02,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 362 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:57:02,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-24 00:57:02,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2024-10-24 00:57:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 182 states have (on average 1.598901098901099) internal successors, (291), 185 states have internal predecessors, (291), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 00:57:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 368 transitions. [2024-10-24 00:57:02,921 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 368 transitions. Word has length 80 [2024-10-24 00:57:02,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:02,922 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 368 transitions. [2024-10-24 00:57:02,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:02,923 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 368 transitions. [2024-10-24 00:57:02,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 00:57:02,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:02,926 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] [2024-10-24 00:57:02,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 00:57:03,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-24 00:57:03,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:03,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:03,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1635089019, now seen corresponding path program 1 times [2024-10-24 00:57:03,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:03,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754756570] [2024-10-24 00:57:03,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:03,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:03,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:03,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:03,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:03,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:57:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:03,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:57:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:03,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:57:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:03,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:57:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:03,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:57:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:03,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:57:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:03,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:57:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:57:03,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:03,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754756570] [2024-10-24 00:57:03,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754756570] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:57:03,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035359007] [2024-10-24 00:57:03,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:03,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:03,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:57:03,377 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:57:03,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 00:57:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:03,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 00:57:03,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:57:03,632 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:57:03,633 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:57:03,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035359007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:03,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:57:03,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-24 00:57:03,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468725064] [2024-10-24 00:57:03,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:03,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:57:03,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:03,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:57:03,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:57:03,635 INFO L87 Difference]: Start difference. First operand 237 states and 368 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:03,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:03,675 INFO L93 Difference]: Finished difference Result 335 states and 509 transitions. [2024-10-24 00:57:03,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:57:03,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 81 [2024-10-24 00:57:03,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:03,681 INFO L225 Difference]: With dead ends: 335 [2024-10-24 00:57:03,681 INFO L226 Difference]: Without dead ends: 239 [2024-10-24 00:57:03,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:57:03,683 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 0 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:03,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 717 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:57:03,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-24 00:57:03,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2024-10-24 00:57:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 184 states have (on average 1.5923913043478262) internal successors, (293), 187 states have internal predecessors, (293), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 00:57:03,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 370 transitions. [2024-10-24 00:57:03,702 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 370 transitions. Word has length 81 [2024-10-24 00:57:03,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:03,702 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 370 transitions. [2024-10-24 00:57:03,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 370 transitions. [2024-10-24 00:57:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 00:57:03,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:03,705 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] [2024-10-24 00:57:03,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 00:57:03,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-24 00:57:03,906 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:03,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:03,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1708651565, now seen corresponding path program 1 times [2024-10-24 00:57:03,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:03,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234628449] [2024-10-24 00:57:03,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:03,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:57:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:57:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:57:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 00:57:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 00:57:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:57:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:57:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,106 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:57:04,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:04,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234628449] [2024-10-24 00:57:04,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234628449] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:57:04,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157061828] [2024-10-24 00:57:04,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:04,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:04,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:57:04,109 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:57:04,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 00:57:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:57:04,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:57:04,337 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:57:04,338 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:57:04,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157061828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:04,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:57:04,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-24 00:57:04,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876276520] [2024-10-24 00:57:04,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:04,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:57:04,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:04,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:57:04,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:57:04,339 INFO L87 Difference]: Start difference. First operand 239 states and 370 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:04,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:04,382 INFO L93 Difference]: Finished difference Result 504 states and 792 transitions. [2024-10-24 00:57:04,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:57:04,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 86 [2024-10-24 00:57:04,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:04,386 INFO L225 Difference]: With dead ends: 504 [2024-10-24 00:57:04,386 INFO L226 Difference]: Without dead ends: 287 [2024-10-24 00:57:04,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:57:04,392 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 95 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:04,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 678 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:57:04,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-24 00:57:04,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 282. [2024-10-24 00:57:04,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 216 states have (on average 1.6018518518518519) internal successors, (346), 219 states have internal predecessors, (346), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-24 00:57:04,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 445 transitions. [2024-10-24 00:57:04,418 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 445 transitions. Word has length 86 [2024-10-24 00:57:04,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:04,420 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 445 transitions. [2024-10-24 00:57:04,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:04,420 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 445 transitions. [2024-10-24 00:57:04,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 00:57:04,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:04,423 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] [2024-10-24 00:57:04,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 00:57:04,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:04,624 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:04,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:04,624 INFO L85 PathProgramCache]: Analyzing trace with hash -308274607, now seen corresponding path program 1 times [2024-10-24 00:57:04,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:04,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444542318] [2024-10-24 00:57:04,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:04,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:57:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:57:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:57:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 00:57:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 00:57:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:57:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:57:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,756 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:57:04,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:04,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444542318] [2024-10-24 00:57:04,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444542318] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:57:04,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804352341] [2024-10-24 00:57:04,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:04,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:04,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:57:04,758 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:57:04,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 00:57:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:04,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 00:57:04,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:57:04,991 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 00:57:04,992 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:57:04,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804352341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:04,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:57:04,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-10-24 00:57:04,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205275176] [2024-10-24 00:57:04,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:04,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:57:04,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:04,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:57:04,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:57:04,993 INFO L87 Difference]: Start difference. First operand 282 states and 445 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 00:57:05,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:05,054 INFO L93 Difference]: Finished difference Result 559 states and 884 transitions. [2024-10-24 00:57:05,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:57:05,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2024-10-24 00:57:05,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:05,060 INFO L225 Difference]: With dead ends: 559 [2024-10-24 00:57:05,060 INFO L226 Difference]: Without dead ends: 284 [2024-10-24 00:57:05,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:57:05,062 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 2 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:05,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1393 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:57:05,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-24 00:57:05,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-10-24 00:57:05,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 217 states have (on average 1.599078341013825) internal successors, (347), 221 states have internal predecessors, (347), 50 states have call successors, (50), 15 states have call predecessors, (50), 16 states have return successors, (51), 49 states have call predecessors, (51), 49 states have call successors, (51) [2024-10-24 00:57:05,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 448 transitions. [2024-10-24 00:57:05,084 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 448 transitions. Word has length 87 [2024-10-24 00:57:05,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:05,084 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 448 transitions. [2024-10-24 00:57:05,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 00:57:05,084 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 448 transitions. [2024-10-24 00:57:05,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 00:57:05,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:05,086 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] [2024-10-24 00:57:05,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 00:57:05,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:05,286 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:05,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:05,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1231540806, now seen corresponding path program 1 times [2024-10-24 00:57:05,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:05,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086351255] [2024-10-24 00:57:05,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:05,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:05,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:05,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:05,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:05,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:05,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 00:57:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:05,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 00:57:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:05,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 00:57:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:05,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 00:57:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:05,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:57:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:05,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:57:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:57:05,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:05,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086351255] [2024-10-24 00:57:05,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086351255] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:57:05,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280389750] [2024-10-24 00:57:05,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:05,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:05,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:57:05,484 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:57:05,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 00:57:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:05,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 00:57:05,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:57:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 00:57:05,719 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:57:05,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280389750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:05,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:57:05,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-10-24 00:57:05,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037953884] [2024-10-24 00:57:05,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:05,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:57:05,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:05,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:57:05,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:57:05,721 INFO L87 Difference]: Start difference. First operand 284 states and 448 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 00:57:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:05,780 INFO L93 Difference]: Finished difference Result 561 states and 889 transitions. [2024-10-24 00:57:05,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:57:05,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 88 [2024-10-24 00:57:05,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:05,782 INFO L225 Difference]: With dead ends: 561 [2024-10-24 00:57:05,782 INFO L226 Difference]: Without dead ends: 286 [2024-10-24 00:57:05,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:57:05,784 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 2 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:05,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1379 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:57:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-24 00:57:05,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2024-10-24 00:57:05,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 218 states have (on average 1.5963302752293578) internal successors, (348), 223 states have internal predecessors, (348), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (56), 49 states have call predecessors, (56), 49 states have call successors, (56) [2024-10-24 00:57:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 454 transitions. [2024-10-24 00:57:05,793 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 454 transitions. Word has length 88 [2024-10-24 00:57:05,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:05,793 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 454 transitions. [2024-10-24 00:57:05,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 00:57:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 454 transitions. [2024-10-24 00:57:05,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-24 00:57:05,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:05,795 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] [2024-10-24 00:57:05,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 00:57:05,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:05,996 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:05,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:05,997 INFO L85 PathProgramCache]: Analyzing trace with hash 16013830, now seen corresponding path program 1 times [2024-10-24 00:57:05,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:05,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294202006] [2024-10-24 00:57:05,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:05,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:06,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:06,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:06,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:06,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:06,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:06,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 00:57:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:06,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 00:57:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:06,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:57:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:06,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:57:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:06,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:57:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:57:06,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:06,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294202006] [2024-10-24 00:57:06,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294202006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:06,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:06,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 00:57:06,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802549640] [2024-10-24 00:57:06,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:06,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 00:57:06,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:06,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 00:57:06,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 00:57:06,137 INFO L87 Difference]: Start difference. First operand 286 states and 454 transitions. Second operand has 8 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 00:57:07,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:07,079 INFO L93 Difference]: Finished difference Result 598 states and 956 transitions. [2024-10-24 00:57:07,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:57:07,080 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 89 [2024-10-24 00:57:07,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:07,082 INFO L225 Difference]: With dead ends: 598 [2024-10-24 00:57:07,082 INFO L226 Difference]: Without dead ends: 331 [2024-10-24 00:57:07,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:57:07,087 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 548 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:07,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 817 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 00:57:07,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-24 00:57:07,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 286. [2024-10-24 00:57:07,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 218 states have (on average 1.5963302752293578) internal successors, (348), 223 states have internal predecessors, (348), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (55), 49 states have call predecessors, (55), 49 states have call successors, (55) [2024-10-24 00:57:07,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 453 transitions. [2024-10-24 00:57:07,106 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 453 transitions. Word has length 89 [2024-10-24 00:57:07,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:07,106 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 453 transitions. [2024-10-24 00:57:07,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 00:57:07,106 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 453 transitions. [2024-10-24 00:57:07,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-24 00:57:07,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:07,111 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] [2024-10-24 00:57:07,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 00:57:07,112 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:07,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:07,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1150960653, now seen corresponding path program 2 times [2024-10-24 00:57:07,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:07,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148696742] [2024-10-24 00:57:07,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:07,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:07,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:07,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:07,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:07,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:07,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:07,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 00:57:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:07,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 00:57:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:07,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:57:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:07,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:57:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:07,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:57:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:57:07,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:07,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148696742] [2024-10-24 00:57:07,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148696742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:07,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:07,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 00:57:07,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674526002] [2024-10-24 00:57:07,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:07,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 00:57:07,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:07,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 00:57:07,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 00:57:07,258 INFO L87 Difference]: Start difference. First operand 286 states and 453 transitions. Second operand has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 00:57:08,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:08,113 INFO L93 Difference]: Finished difference Result 600 states and 959 transitions. [2024-10-24 00:57:08,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:57:08,113 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 90 [2024-10-24 00:57:08,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:08,115 INFO L225 Difference]: With dead ends: 600 [2024-10-24 00:57:08,115 INFO L226 Difference]: Without dead ends: 333 [2024-10-24 00:57:08,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:57:08,116 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 545 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1424 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:08,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 817 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1424 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 00:57:08,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-24 00:57:08,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 288. [2024-10-24 00:57:08,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 219 states have (on average 1.5936073059360731) internal successors, (349), 225 states have internal predecessors, (349), 50 states have call successors, (50), 15 states have call predecessors, (50), 18 states have return successors, (57), 49 states have call predecessors, (57), 49 states have call successors, (57) [2024-10-24 00:57:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 456 transitions. [2024-10-24 00:57:08,141 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 456 transitions. Word has length 90 [2024-10-24 00:57:08,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:08,143 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 456 transitions. [2024-10-24 00:57:08,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 00:57:08,144 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 456 transitions. [2024-10-24 00:57:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 00:57:08,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:08,146 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] [2024-10-24 00:57:08,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 00:57:08,146 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:08,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:08,146 INFO L85 PathProgramCache]: Analyzing trace with hash -918644053, now seen corresponding path program 1 times [2024-10-24 00:57:08,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:08,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370935568] [2024-10-24 00:57:08,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:08,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:08,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:08,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:08,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:08,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:08,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:08,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:08,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:57:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:08,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:57:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:08,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:57:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:08,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:57:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:57:08,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:08,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370935568] [2024-10-24 00:57:08,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370935568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:08,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:08,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 00:57:08,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825406932] [2024-10-24 00:57:08,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:08,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 00:57:08,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:08,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 00:57:08,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:57:08,361 INFO L87 Difference]: Start difference. First operand 288 states and 456 transitions. Second operand has 11 states, 10 states have (on average 6.1) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-24 00:57:09,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:09,554 INFO L93 Difference]: Finished difference Result 598 states and 954 transitions. [2024-10-24 00:57:09,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 00:57:09,554 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 91 [2024-10-24 00:57:09,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:09,556 INFO L225 Difference]: With dead ends: 598 [2024-10-24 00:57:09,558 INFO L226 Difference]: Without dead ends: 333 [2024-10-24 00:57:09,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-24 00:57:09,559 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 548 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2400 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 2400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:09,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1174 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 2400 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:57:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-24 00:57:09,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 288. [2024-10-24 00:57:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 219 states have (on average 1.5936073059360731) internal successors, (349), 225 states have internal predecessors, (349), 50 states have call successors, (50), 15 states have call predecessors, (50), 18 states have return successors, (56), 49 states have call predecessors, (56), 49 states have call successors, (56) [2024-10-24 00:57:09,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 455 transitions. [2024-10-24 00:57:09,579 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 455 transitions. Word has length 91 [2024-10-24 00:57:09,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:09,579 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 455 transitions. [2024-10-24 00:57:09,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-24 00:57:09,579 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 455 transitions. [2024-10-24 00:57:09,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 00:57:09,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:09,581 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] [2024-10-24 00:57:09,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 00:57:09,581 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:09,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:09,581 INFO L85 PathProgramCache]: Analyzing trace with hash 568841689, now seen corresponding path program 2 times [2024-10-24 00:57:09,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:09,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525319978] [2024-10-24 00:57:09,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:09,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:09,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:09,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:09,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:09,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:09,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:09,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:09,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:57:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:09,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:57:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:09,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:57:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:09,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:57:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:57:09,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:09,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525319978] [2024-10-24 00:57:09,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525319978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:09,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:09,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 00:57:09,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001605584] [2024-10-24 00:57:09,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:09,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 00:57:09,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:09,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 00:57:09,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:57:09,738 INFO L87 Difference]: Start difference. First operand 288 states and 455 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-24 00:57:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:10,872 INFO L93 Difference]: Finished difference Result 600 states and 960 transitions. [2024-10-24 00:57:10,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 00:57:10,872 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 92 [2024-10-24 00:57:10,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:10,874 INFO L225 Difference]: With dead ends: 600 [2024-10-24 00:57:10,874 INFO L226 Difference]: Without dead ends: 335 [2024-10-24 00:57:10,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-24 00:57:10,886 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 545 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2434 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 2600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 2434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:10,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1175 Invalid, 2600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 2434 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:57:10,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-10-24 00:57:10,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 290. [2024-10-24 00:57:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 220 states have (on average 1.5909090909090908) internal successors, (350), 227 states have internal predecessors, (350), 50 states have call successors, (50), 15 states have call predecessors, (50), 19 states have return successors, (61), 49 states have call predecessors, (61), 49 states have call successors, (61) [2024-10-24 00:57:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 461 transitions. [2024-10-24 00:57:10,901 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 461 transitions. Word has length 92 [2024-10-24 00:57:10,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:10,901 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 461 transitions. [2024-10-24 00:57:10,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 8 states have internal predecessors, (62), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-24 00:57:10,902 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 461 transitions. [2024-10-24 00:57:10,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 00:57:10,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:10,903 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] [2024-10-24 00:57:10,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 00:57:10,903 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:10,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:10,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1601472528, now seen corresponding path program 1 times [2024-10-24 00:57:10,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:10,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945666682] [2024-10-24 00:57:10,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:10,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:10,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:10,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:10,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:10,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:10,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:10,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:10,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:57:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:10,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:57:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:10,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:57:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:10,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:57:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:10,995 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:10,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:10,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945666682] [2024-10-24 00:57:10,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945666682] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:57:10,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362938596] [2024-10-24 00:57:10,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:10,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:10,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:57:10,997 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:57:10,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 00:57:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:11,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:57:11,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:57:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:11,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:57:11,265 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:11,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362938596] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:57:11,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:57:11,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-10-24 00:57:11,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259251417] [2024-10-24 00:57:11,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:57:11,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 00:57:11,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:11,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 00:57:11,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:57:11,266 INFO L87 Difference]: Start difference. First operand 290 states and 461 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:57:12,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:12,133 INFO L93 Difference]: Finished difference Result 741 states and 1245 transitions. [2024-10-24 00:57:12,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 00:57:12,134 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2024-10-24 00:57:12,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:12,137 INFO L225 Difference]: With dead ends: 741 [2024-10-24 00:57:12,137 INFO L226 Difference]: Without dead ends: 645 [2024-10-24 00:57:12,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:57:12,138 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 869 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:12,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 1131 Invalid, 1492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 00:57:12,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-10-24 00:57:12,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 585. [2024-10-24 00:57:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 451 states have (on average 1.6407982261640799) internal successors, (740), 458 states have internal predecessors, (740), 114 states have call successors, (114), 15 states have call predecessors, (114), 19 states have return successors, (135), 113 states have call predecessors, (135), 113 states have call successors, (135) [2024-10-24 00:57:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 989 transitions. [2024-10-24 00:57:12,165 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 989 transitions. Word has length 93 [2024-10-24 00:57:12,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:12,166 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 989 transitions. [2024-10-24 00:57:12,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:57:12,166 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 989 transitions. [2024-10-24 00:57:12,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 00:57:12,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:12,168 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] [2024-10-24 00:57:12,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 00:57:12,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:12,369 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:12,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:12,370 INFO L85 PathProgramCache]: Analyzing trace with hash 340478701, now seen corresponding path program 1 times [2024-10-24 00:57:12,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:12,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411673788] [2024-10-24 00:57:12,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:12,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:12,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:12,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:12,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:12,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:12,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:12,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:12,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:57:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:12,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:57:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:12,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:57:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:12,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:57:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:12,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:12,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411673788] [2024-10-24 00:57:12,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411673788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:12,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:12,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:57:12,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287768556] [2024-10-24 00:57:12,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:12,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:57:12,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:12,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:57:12,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:57:12,450 INFO L87 Difference]: Start difference. First operand 585 states and 989 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:13,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:13,120 INFO L93 Difference]: Finished difference Result 1452 states and 2514 transitions. [2024-10-24 00:57:13,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:57:13,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2024-10-24 00:57:13,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:13,125 INFO L225 Difference]: With dead ends: 1452 [2024-10-24 00:57:13,125 INFO L226 Difference]: Without dead ends: 927 [2024-10-24 00:57:13,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:57:13,127 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 637 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:13,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 599 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 00:57:13,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2024-10-24 00:57:13,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 877. [2024-10-24 00:57:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 679 states have (on average 1.6450662739322532) internal successors, (1117), 686 states have internal predecessors, (1117), 178 states have call successors, (178), 15 states have call predecessors, (178), 19 states have return successors, (209), 177 states have call predecessors, (209), 177 states have call successors, (209) [2024-10-24 00:57:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1504 transitions. [2024-10-24 00:57:13,179 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1504 transitions. Word has length 99 [2024-10-24 00:57:13,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:13,180 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1504 transitions. [2024-10-24 00:57:13,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1504 transitions. [2024-10-24 00:57:13,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 00:57:13,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:13,184 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] [2024-10-24 00:57:13,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 00:57:13,184 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:13,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:13,185 INFO L85 PathProgramCache]: Analyzing trace with hash -284132076, now seen corresponding path program 1 times [2024-10-24 00:57:13,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:13,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388789213] [2024-10-24 00:57:13,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:13,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:13,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:13,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:13,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:13,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:13,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:13,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:13,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:57:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:13,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:57:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:13,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:57:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:13,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:57:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:13,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:13,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388789213] [2024-10-24 00:57:13,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388789213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:13,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:13,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:57:13,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125140583] [2024-10-24 00:57:13,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:13,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:57:13,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:13,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:57:13,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:57:13,264 INFO L87 Difference]: Start difference. First operand 877 states and 1504 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:14,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:14,023 INFO L93 Difference]: Finished difference Result 2149 states and 3741 transitions. [2024-10-24 00:57:14,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:57:14,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 100 [2024-10-24 00:57:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:14,030 INFO L225 Difference]: With dead ends: 2149 [2024-10-24 00:57:14,030 INFO L226 Difference]: Without dead ends: 1382 [2024-10-24 00:57:14,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:57:14,032 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 635 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:14,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 572 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 00:57:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-10-24 00:57:14,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1332. [2024-10-24 00:57:14,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1039 states have (on average 1.6467757459095285) internal successors, (1711), 1046 states have internal predecessors, (1711), 273 states have call successors, (273), 15 states have call predecessors, (273), 19 states have return successors, (304), 272 states have call predecessors, (304), 272 states have call successors, (304) [2024-10-24 00:57:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 2288 transitions. [2024-10-24 00:57:14,074 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 2288 transitions. Word has length 100 [2024-10-24 00:57:14,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:14,074 INFO L471 AbstractCegarLoop]: Abstraction has 1332 states and 2288 transitions. [2024-10-24 00:57:14,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:14,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 2288 transitions. [2024-10-24 00:57:14,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 00:57:14,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:14,079 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] [2024-10-24 00:57:14,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 00:57:14,079 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:14,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:14,079 INFO L85 PathProgramCache]: Analyzing trace with hash -544784209, now seen corresponding path program 1 times [2024-10-24 00:57:14,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:14,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286541104] [2024-10-24 00:57:14,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:14,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:57:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:57:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:57:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:57:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,162 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:14,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:14,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286541104] [2024-10-24 00:57:14,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286541104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:14,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:14,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:57:14,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308749128] [2024-10-24 00:57:14,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:14,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:57:14,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:14,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:57:14,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:57:14,163 INFO L87 Difference]: Start difference. First operand 1332 states and 2288 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:14,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:14,820 INFO L93 Difference]: Finished difference Result 3167 states and 5553 transitions. [2024-10-24 00:57:14,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:57:14,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2024-10-24 00:57:14,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:14,831 INFO L225 Difference]: With dead ends: 3167 [2024-10-24 00:57:14,831 INFO L226 Difference]: Without dead ends: 2065 [2024-10-24 00:57:14,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:57:14,836 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 633 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:14,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 570 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 00:57:14,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2065 states. [2024-10-24 00:57:14,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2065 to 2015. [2024-10-24 00:57:14,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2015 states, 1599 states have (on average 1.6491557223264541) internal successors, (2637), 1606 states have internal predecessors, (2637), 396 states have call successors, (396), 15 states have call predecessors, (396), 19 states have return successors, (443), 395 states have call predecessors, (443), 395 states have call successors, (443) [2024-10-24 00:57:14,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2015 states to 2015 states and 3476 transitions. [2024-10-24 00:57:14,920 INFO L78 Accepts]: Start accepts. Automaton has 2015 states and 3476 transitions. Word has length 101 [2024-10-24 00:57:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:14,920 INFO L471 AbstractCegarLoop]: Abstraction has 2015 states and 3476 transitions. [2024-10-24 00:57:14,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2015 states and 3476 transitions. [2024-10-24 00:57:14,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 00:57:14,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:14,925 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:14,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 00:57:14,926 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:14,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:14,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2115373931, now seen corresponding path program 1 times [2024-10-24 00:57:14,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:14,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517208542] [2024-10-24 00:57:14,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:14,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:57:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:57:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:57:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:57:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:14,992 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:14,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:14,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517208542] [2024-10-24 00:57:14,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517208542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:14,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:14,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:57:14,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134878824] [2024-10-24 00:57:14,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:14,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:57:14,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:14,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:57:14,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:57:14,993 INFO L87 Difference]: Start difference. First operand 2015 states and 3476 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:15,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:15,682 INFO L93 Difference]: Finished difference Result 4737 states and 8358 transitions. [2024-10-24 00:57:15,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:57:15,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 102 [2024-10-24 00:57:15,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:15,718 INFO L225 Difference]: With dead ends: 4737 [2024-10-24 00:57:15,718 INFO L226 Difference]: Without dead ends: 3149 [2024-10-24 00:57:15,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:57:15,723 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 631 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:15,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 570 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 00:57:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3149 states. [2024-10-24 00:57:15,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3149 to 3099. [2024-10-24 00:57:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3099 states, 2504 states have (on average 1.65055910543131) internal successors, (4133), 2511 states have internal predecessors, (4133), 575 states have call successors, (575), 15 states have call predecessors, (575), 19 states have return successors, (648), 574 states have call predecessors, (648), 574 states have call successors, (648) [2024-10-24 00:57:15,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 5356 transitions. [2024-10-24 00:57:15,852 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 5356 transitions. Word has length 102 [2024-10-24 00:57:15,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:15,853 INFO L471 AbstractCegarLoop]: Abstraction has 3099 states and 5356 transitions. [2024-10-24 00:57:15,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:15,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 5356 transitions. [2024-10-24 00:57:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 00:57:15,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:15,859 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:15,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 00:57:15,859 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:15,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1299700853, now seen corresponding path program 1 times [2024-10-24 00:57:15,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:15,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39281500] [2024-10-24 00:57:15,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:15,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:57:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:57:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:57:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:57:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:15,928 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:15,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:15,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39281500] [2024-10-24 00:57:15,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39281500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:15,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:15,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:57:15,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892145470] [2024-10-24 00:57:15,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:15,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:57:15,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:15,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:57:15,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:57:15,931 INFO L87 Difference]: Start difference. First operand 3099 states and 5356 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:16,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:16,650 INFO L93 Difference]: Finished difference Result 7568 states and 13370 transitions. [2024-10-24 00:57:16,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:57:16,651 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 103 [2024-10-24 00:57:16,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:16,673 INFO L225 Difference]: With dead ends: 7568 [2024-10-24 00:57:16,673 INFO L226 Difference]: Without dead ends: 5119 [2024-10-24 00:57:16,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:57:16,682 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 629 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:16,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 599 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 00:57:16,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5119 states. [2024-10-24 00:57:16,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5119 to 5069. [2024-10-24 00:57:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5069 states, 4098 states have (on average 1.6408003904343582) internal successors, (6724), 4105 states have internal predecessors, (6724), 951 states have call successors, (951), 15 states have call predecessors, (951), 19 states have return successors, (1068), 950 states have call predecessors, (1068), 950 states have call successors, (1068) [2024-10-24 00:57:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5069 states to 5069 states and 8743 transitions. [2024-10-24 00:57:16,899 INFO L78 Accepts]: Start accepts. Automaton has 5069 states and 8743 transitions. Word has length 103 [2024-10-24 00:57:16,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:16,900 INFO L471 AbstractCegarLoop]: Abstraction has 5069 states and 8743 transitions. [2024-10-24 00:57:16,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:16,900 INFO L276 IsEmpty]: Start isEmpty. Operand 5069 states and 8743 transitions. [2024-10-24 00:57:16,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 00:57:16,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:16,909 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:16,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 00:57:16,910 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:16,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:16,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1018021447, now seen corresponding path program 1 times [2024-10-24 00:57:16,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:16,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864423321] [2024-10-24 00:57:16,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:16,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:57:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:57:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:57:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:57:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:16,975 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:16,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:16,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864423321] [2024-10-24 00:57:16,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864423321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:16,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:16,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:57:16,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532083118] [2024-10-24 00:57:16,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:16,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:57:16,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:16,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:57:16,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:57:16,977 INFO L87 Difference]: Start difference. First operand 5069 states and 8743 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:17,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:17,709 INFO L93 Difference]: Finished difference Result 12549 states and 22118 transitions. [2024-10-24 00:57:17,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:57:17,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 104 [2024-10-24 00:57:17,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:17,755 INFO L225 Difference]: With dead ends: 12549 [2024-10-24 00:57:17,756 INFO L226 Difference]: Without dead ends: 8496 [2024-10-24 00:57:17,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:57:17,768 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 627 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:17,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 581 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 00:57:17,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8496 states. [2024-10-24 00:57:18,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8496 to 8446. [2024-10-24 00:57:18,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8446 states, 6869 states have (on average 1.6373562381714952) internal successors, (11247), 6876 states have internal predecessors, (11247), 1557 states have call successors, (1557), 15 states have call predecessors, (1557), 19 states have return successors, (1752), 1556 states have call predecessors, (1752), 1556 states have call successors, (1752) [2024-10-24 00:57:18,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8446 states to 8446 states and 14556 transitions. [2024-10-24 00:57:18,086 INFO L78 Accepts]: Start accepts. Automaton has 8446 states and 14556 transitions. Word has length 104 [2024-10-24 00:57:18,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:18,086 INFO L471 AbstractCegarLoop]: Abstraction has 8446 states and 14556 transitions. [2024-10-24 00:57:18,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:18,087 INFO L276 IsEmpty]: Start isEmpty. Operand 8446 states and 14556 transitions. [2024-10-24 00:57:18,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 00:57:18,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:18,100 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:18,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 00:57:18,101 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:18,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:18,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1542431955, now seen corresponding path program 1 times [2024-10-24 00:57:18,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:18,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985225483] [2024-10-24 00:57:18,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:18,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:57:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:57:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:57:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:57:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:18,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:18,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985225483] [2024-10-24 00:57:18,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985225483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:18,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:18,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:57:18,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967112250] [2024-10-24 00:57:18,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:18,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:57:18,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:18,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:57:18,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:57:18,167 INFO L87 Difference]: Start difference. First operand 8446 states and 14556 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:18,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:18,960 INFO L93 Difference]: Finished difference Result 21901 states and 38517 transitions. [2024-10-24 00:57:18,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:57:18,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 105 [2024-10-24 00:57:18,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:19,007 INFO L225 Difference]: With dead ends: 21901 [2024-10-24 00:57:19,007 INFO L226 Difference]: Without dead ends: 14880 [2024-10-24 00:57:19,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:57:19,068 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 625 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:19,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 589 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 00:57:19,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14880 states. [2024-10-24 00:57:19,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14880 to 14830. [2024-10-24 00:57:19,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14830 states, 12050 states have (on average 1.6268879668049792) internal successors, (19604), 12057 states have internal predecessors, (19604), 2760 states have call successors, (2760), 15 states have call predecessors, (2760), 19 states have return successors, (3099), 2759 states have call predecessors, (3099), 2759 states have call successors, (3099) [2024-10-24 00:57:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14830 states to 14830 states and 25463 transitions. [2024-10-24 00:57:19,464 INFO L78 Accepts]: Start accepts. Automaton has 14830 states and 25463 transitions. Word has length 105 [2024-10-24 00:57:19,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:19,465 INFO L471 AbstractCegarLoop]: Abstraction has 14830 states and 25463 transitions. [2024-10-24 00:57:19,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 14830 states and 25463 transitions. [2024-10-24 00:57:19,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 00:57:19,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:19,481 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:19,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 00:57:19,481 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:19,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:19,482 INFO L85 PathProgramCache]: Analyzing trace with hash 699966682, now seen corresponding path program 1 times [2024-10-24 00:57:19,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:19,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191708172] [2024-10-24 00:57:19,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:19,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:19,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:19,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:19,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:19,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:19,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:19,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:19,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:57:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:19,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:57:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:19,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:57:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:19,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:57:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:19,550 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:19,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:19,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191708172] [2024-10-24 00:57:19,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191708172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:19,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:19,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:57:19,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91641553] [2024-10-24 00:57:19,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:19,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:57:19,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:19,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:57:19,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:57:19,551 INFO L87 Difference]: Start difference. First operand 14830 states and 25463 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:20,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:20,679 INFO L93 Difference]: Finished difference Result 39260 states and 68903 transitions. [2024-10-24 00:57:20,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:57:20,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 106 [2024-10-24 00:57:20,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:20,764 INFO L225 Difference]: With dead ends: 39260 [2024-10-24 00:57:20,765 INFO L226 Difference]: Without dead ends: 26447 [2024-10-24 00:57:20,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:57:20,797 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 623 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:20,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 571 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 00:57:20,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26447 states. [2024-10-24 00:57:21,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26447 to 26397. [2024-10-24 00:57:21,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26397 states, 21578 states have (on average 1.6224395217351006) internal successors, (35009), 21585 states have internal predecessors, (35009), 4799 states have call successors, (4799), 15 states have call predecessors, (4799), 19 states have return successors, (5412), 4798 states have call predecessors, (5412), 4798 states have call successors, (5412) [2024-10-24 00:57:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26397 states to 26397 states and 45220 transitions. [2024-10-24 00:57:21,599 INFO L78 Accepts]: Start accepts. Automaton has 26397 states and 45220 transitions. Word has length 106 [2024-10-24 00:57:21,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:21,599 INFO L471 AbstractCegarLoop]: Abstraction has 26397 states and 45220 transitions. [2024-10-24 00:57:21,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:21,600 INFO L276 IsEmpty]: Start isEmpty. Operand 26397 states and 45220 transitions. [2024-10-24 00:57:21,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 00:57:21,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:21,617 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:21,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 00:57:21,617 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:21,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:21,617 INFO L85 PathProgramCache]: Analyzing trace with hash 376836911, now seen corresponding path program 1 times [2024-10-24 00:57:21,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:21,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921201099] [2024-10-24 00:57:21,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:21,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:57:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:57:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:57:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:57:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:21,683 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:21,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:21,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921201099] [2024-10-24 00:57:21,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921201099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:21,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:21,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:57:21,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666807088] [2024-10-24 00:57:21,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:21,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:57:21,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:21,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:57:21,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:57:21,685 INFO L87 Difference]: Start difference. First operand 26397 states and 45220 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:23,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:23,418 INFO L93 Difference]: Finished difference Result 71872 states and 125327 transitions. [2024-10-24 00:57:23,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:57:23,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 107 [2024-10-24 00:57:23,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:23,561 INFO L225 Difference]: With dead ends: 71872 [2024-10-24 00:57:23,561 INFO L226 Difference]: Without dead ends: 48207 [2024-10-24 00:57:23,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:57:23,611 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 621 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:23,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 582 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 00:57:23,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48207 states. [2024-10-24 00:57:25,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48207 to 48157. [2024-10-24 00:57:25,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48157 states, 39623 states have (on average 1.6167629911919845) internal successors, (64061), 39630 states have internal predecessors, (64061), 8514 states have call successors, (8514), 15 states have call predecessors, (8514), 19 states have return successors, (9659), 8513 states have call predecessors, (9659), 8513 states have call successors, (9659) [2024-10-24 00:57:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48157 states to 48157 states and 82234 transitions. [2024-10-24 00:57:25,612 INFO L78 Accepts]: Start accepts. Automaton has 48157 states and 82234 transitions. Word has length 107 [2024-10-24 00:57:25,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:25,613 INFO L471 AbstractCegarLoop]: Abstraction has 48157 states and 82234 transitions. [2024-10-24 00:57:25,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:25,613 INFO L276 IsEmpty]: Start isEmpty. Operand 48157 states and 82234 transitions. [2024-10-24 00:57:25,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 00:57:25,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:25,632 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:25,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 00:57:25,633 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:25,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:25,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1885380058, now seen corresponding path program 1 times [2024-10-24 00:57:25,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:25,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277993922] [2024-10-24 00:57:25,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:25,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:25,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:57:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:57:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:57:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:57:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:25,698 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:25,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:25,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277993922] [2024-10-24 00:57:25,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277993922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:25,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:25,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:57:25,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904881206] [2024-10-24 00:57:25,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:25,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:57:25,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:25,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:57:25,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:57:25,701 INFO L87 Difference]: Start difference. First operand 48157 states and 82234 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:27,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:27,883 INFO L93 Difference]: Finished difference Result 89591 states and 156691 transitions. [2024-10-24 00:57:27,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:57:27,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 108 [2024-10-24 00:57:27,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:28,195 INFO L225 Difference]: With dead ends: 89591 [2024-10-24 00:57:28,195 INFO L226 Difference]: Without dead ends: 89495 [2024-10-24 00:57:28,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:57:28,233 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 616 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:28,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 583 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 00:57:28,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89495 states. [2024-10-24 00:57:30,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89495 to 89445. [2024-10-24 00:57:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89445 states, 74112 states have (on average 1.6096043825561313) internal successors, (119291), 74119 states have internal predecessors, (119291), 15313 states have call successors, (15313), 15 states have call predecessors, (15313), 19 states have return successors, (17504), 15312 states have call predecessors, (17504), 15312 states have call successors, (17504) [2024-10-24 00:57:30,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89445 states to 89445 states and 152108 transitions. [2024-10-24 00:57:31,004 INFO L78 Accepts]: Start accepts. Automaton has 89445 states and 152108 transitions. Word has length 108 [2024-10-24 00:57:31,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:31,004 INFO L471 AbstractCegarLoop]: Abstraction has 89445 states and 152108 transitions. [2024-10-24 00:57:31,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:57:31,005 INFO L276 IsEmpty]: Start isEmpty. Operand 89445 states and 152108 transitions. [2024-10-24 00:57:31,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 00:57:31,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:31,020 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:31,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 00:57:31,020 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:31,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:31,020 INFO L85 PathProgramCache]: Analyzing trace with hash -494250098, now seen corresponding path program 1 times [2024-10-24 00:57:31,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:31,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998559573] [2024-10-24 00:57:31,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:31,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:57:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:57:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:57:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:57:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:31,284 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:31,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:31,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998559573] [2024-10-24 00:57:31,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998559573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:31,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:31,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 00:57:31,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240289720] [2024-10-24 00:57:31,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:31,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 00:57:31,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:31,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 00:57:31,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:57:31,286 INFO L87 Difference]: Start difference. First operand 89445 states and 152108 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 9 states have internal predecessors, (74), 5 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-24 00:57:37,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:37,080 INFO L93 Difference]: Finished difference Result 178339 states and 315275 transitions. [2024-10-24 00:57:37,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-24 00:57:37,080 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 9 states have internal predecessors, (74), 5 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 109 [2024-10-24 00:57:37,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:37,975 INFO L225 Difference]: With dead ends: 178339 [2024-10-24 00:57:37,975 INFO L226 Difference]: Without dead ends: 178250 [2024-10-24 00:57:38,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=370, Invalid=1190, Unknown=0, NotChecked=0, Total=1560 [2024-10-24 00:57:38,058 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 1741 mSDsluCounter, 1583 mSDsCounter, 0 mSdLazyCounter, 4029 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 4515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 4029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:38,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 1791 Invalid, 4515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 4029 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 00:57:38,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178250 states. [2024-10-24 00:57:43,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178250 to 178092. [2024-10-24 00:57:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178092 states, 147639 states have (on average 1.6106381105263514) internal successors, (237793), 147541 states have internal predecessors, (237793), 30409 states have call successors, (30409), 38 states have call predecessors, (30409), 43 states have return successors, (38058), 30518 states have call predecessors, (38058), 30406 states have call successors, (38058) [2024-10-24 00:57:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178092 states to 178092 states and 306260 transitions. [2024-10-24 00:57:45,003 INFO L78 Accepts]: Start accepts. Automaton has 178092 states and 306260 transitions. Word has length 109 [2024-10-24 00:57:45,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:45,004 INFO L471 AbstractCegarLoop]: Abstraction has 178092 states and 306260 transitions. [2024-10-24 00:57:45,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 9 states have internal predecessors, (74), 5 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-24 00:57:45,004 INFO L276 IsEmpty]: Start isEmpty. Operand 178092 states and 306260 transitions. [2024-10-24 00:57:45,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 00:57:45,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:45,036 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:45,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 00:57:45,036 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:45,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:45,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2043555376, now seen corresponding path program 1 times [2024-10-24 00:57:45,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:45,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037715653] [2024-10-24 00:57:45,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:45,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:57:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:57:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:57:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:57:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:57:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:57:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:57:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:45,123 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:57:45,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:45,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037715653] [2024-10-24 00:57:45,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037715653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:45,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:57:45,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:57:45,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783462089] [2024-10-24 00:57:45,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:45,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:57:45,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:45,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:57:45,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:57:45,125 INFO L87 Difference]: Start difference. First operand 178092 states and 306260 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 00:57:49,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:49,311 INFO L93 Difference]: Finished difference Result 178276 states and 313030 transitions. [2024-10-24 00:57:49,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 00:57:49,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 110 [2024-10-24 00:57:49,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:49,939 INFO L225 Difference]: With dead ends: 178276 [2024-10-24 00:57:49,939 INFO L226 Difference]: Without dead ends: 178098 [2024-10-24 00:57:50,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:57:50,005 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 561 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:50,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 703 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 00:57:50,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178098 states.