./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec9_product31.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec9_product31.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 28cb2c1915c61c386f3394fd53d16960f7cb856128220666f501d4f4a00b7894 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 07:50:19,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 07:50:19,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 07:50:19,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 07:50:19,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 07:50:19,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 07:50:19,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 07:50:19,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 07:50:19,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 07:50:19,420 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 07:50:19,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 07:50:19,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 07:50:19,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 07:50:19,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 07:50:19,423 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 07:50:19,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 07:50:19,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 07:50:19,424 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 07:50:19,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 07:50:19,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 07:50:19,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 07:50:19,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 07:50:19,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 07:50:19,428 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 07:50:19,428 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 07:50:19,428 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 07:50:19,429 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 07:50:19,429 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 07:50:19,429 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 07:50:19,429 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 07:50:19,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 07:50:19,430 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 07:50:19,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:50:19,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 07:50:19,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 07:50:19,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 07:50:19,431 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 07:50:19,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 07:50:19,431 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 07:50:19,432 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 07:50:19,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 07:50:19,433 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 07:50:19,433 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 -> 28cb2c1915c61c386f3394fd53d16960f7cb856128220666f501d4f4a00b7894 [2024-11-16 07:50:19,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 07:50:19,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 07:50:19,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 07:50:19,690 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 07:50:19,690 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 07:50:19,692 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec9_product31.cil.c [2024-11-16 07:50:21,035 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 07:50:21,270 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 07:50:21,271 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product31.cil.c [2024-11-16 07:50:21,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f30136f86/5e6669f369f9459890d263c672031cc5/FLAG8bd2ba221 [2024-11-16 07:50:21,308 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f30136f86/5e6669f369f9459890d263c672031cc5 [2024-11-16 07:50:21,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 07:50:21,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 07:50:21,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 07:50:21,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 07:50:21,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 07:50:21,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:50:21" (1/1) ... [2024-11-16 07:50:21,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26b408ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:21, skipping insertion in model container [2024-11-16 07:50:21,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:50:21" (1/1) ... [2024-11-16 07:50:21,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 07:50:21,780 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product31.cil.c[56976,56989] [2024-11-16 07:50:21,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:50:21,829 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 07:50:21,837 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2024-11-16 07:50:21,838 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [66] [2024-11-16 07:50:21,838 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [115] [2024-11-16 07:50:21,839 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [527] [2024-11-16 07:50:21,839 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [752] [2024-11-16 07:50:21,839 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1118] [2024-11-16 07:50:21,839 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2198] [2024-11-16 07:50:21,839 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2565] [2024-11-16 07:50:21,840 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2574] [2024-11-16 07:50:21,840 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [2849] [2024-11-16 07:50:21,841 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2891] [2024-11-16 07:50:21,916 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product31.cil.c[56976,56989] [2024-11-16 07:50:21,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:50:21,955 INFO L204 MainTranslator]: Completed translation [2024-11-16 07:50:21,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:21 WrapperNode [2024-11-16 07:50:21,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 07:50:21,956 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 07:50:21,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 07:50:21,957 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 07:50:21,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:21" (1/1) ... [2024-11-16 07:50:21,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:21" (1/1) ... [2024-11-16 07:50:22,044 INFO L138 Inliner]: procedures = 132, calls = 207, calls flagged for inlining = 62, calls inlined = 57, statements flattened = 1042 [2024-11-16 07:50:22,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 07:50:22,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 07:50:22,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 07:50:22,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 07:50:22,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:21" (1/1) ... [2024-11-16 07:50:22,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:21" (1/1) ... [2024-11-16 07:50:22,066 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:21" (1/1) ... [2024-11-16 07:50:22,085 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-11-16 07:50:22,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:21" (1/1) ... [2024-11-16 07:50:22,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:21" (1/1) ... [2024-11-16 07:50:22,098 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:21" (1/1) ... [2024-11-16 07:50:22,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:21" (1/1) ... [2024-11-16 07:50:22,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:21" (1/1) ... [2024-11-16 07:50:22,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:21" (1/1) ... [2024-11-16 07:50:22,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 07:50:22,113 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 07:50:22,113 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 07:50:22,113 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 07:50:22,114 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:21" (1/1) ... [2024-11-16 07:50:22,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:50:22,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:50:22,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 07:50:22,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 07:50:22,188 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-11-16 07:50:22,188 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-11-16 07:50:22,188 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-11-16 07:50:22,188 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-11-16 07:50:22,188 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-11-16 07:50:22,188 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-11-16 07:50:22,188 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-16 07:50:22,189 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-16 07:50:22,189 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-16 07:50:22,189 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-16 07:50:22,189 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-16 07:50:22,189 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-16 07:50:22,189 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-16 07:50:22,189 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-16 07:50:22,189 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-11-16 07:50:22,189 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-11-16 07:50:22,189 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-16 07:50:22,190 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-16 07:50:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-16 07:50:22,190 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-16 07:50:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-16 07:50:22,190 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-16 07:50:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-16 07:50:22,190 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-16 07:50:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 07:50:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-16 07:50:22,190 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-16 07:50:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-11-16 07:50:22,191 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-11-16 07:50:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-16 07:50:22,191 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-16 07:50:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-16 07:50:22,191 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-16 07:50:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-16 07:50:22,191 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-16 07:50:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-11-16 07:50:22,191 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-11-16 07:50:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-16 07:50:22,192 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-16 07:50:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-11-16 07:50:22,192 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-11-16 07:50:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-16 07:50:22,192 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-16 07:50:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-16 07:50:22,192 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-16 07:50:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 07:50:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 07:50:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 07:50:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-16 07:50:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-16 07:50:22,193 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-16 07:50:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 07:50:22,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 07:50:22,351 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 07:50:22,355 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 07:50:22,586 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2175-1: getClientId_#res#1 := getClientId_~retValue_acc~33#1; [2024-11-16 07:50:22,586 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L508-1: isVerified_#res#1 := isVerified_~retValue_acc~13#1; [2024-11-16 07:50:22,586 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2128-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~32#1; [2024-11-16 07:50:22,586 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L171-1: getEmailId_#res#1 := getEmailId_~retValue_acc~4#1; [2024-11-16 07:50:22,595 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L434: #res := ~retValue_acc~11; [2024-11-16 07:50:22,608 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2471: #res := ~retValue_acc~38; [2024-11-16 07:50:22,639 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1787-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~27#1; [2024-11-16 07:50:22,641 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1832: #res#1 := ~retValue_acc~28#1; [2024-11-16 07:50:22,666 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2056: #res := ~retValue_acc~31; [2024-11-16 07:50:22,673 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1740: #res := ~retValue_acc~26; [2024-11-16 07:50:22,681 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3023-1: createEmail_#res#1 := createEmail_~retValue_acc~43#1; [2024-11-16 07:50:22,690 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L360: #res := ~retValue_acc~9; [2024-11-16 07:50:22,700 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L397: #res := ~retValue_acc~10; [2024-11-16 07:50:22,706 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L471: #res := ~retValue_acc~12; [2024-11-16 07:50:22,722 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L245: #res := ~retValue_acc~6; [2024-11-16 07:50:22,959 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2002-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~30#1; [2024-11-16 07:50:22,960 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~29#1; [2024-11-16 07:50:22,960 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L112-1: valid_product_#res#1 := valid_product_~retValue_acc~2#1; [2024-11-16 07:50:22,960 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2428-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~35#1; [2024-11-16 07:50:22,960 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2437-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~36#1; [2024-11-16 07:50:22,960 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2446-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~37#1; [2024-11-16 07:50:22,967 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L208: #res := ~retValue_acc~5; [2024-11-16 07:50:22,975 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2999: #res#1 := ~retValue_acc~41#1; [2024-11-16 07:50:22,976 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2979-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~40#1; [2024-11-16 07:50:23,144 INFO L? ?]: Removed 479 outVars from TransFormulas that were not future-live. [2024-11-16 07:50:23,144 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 07:50:23,168 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 07:50:23,168 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 07:50:23,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:50:23 BoogieIcfgContainer [2024-11-16 07:50:23,168 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 07:50:23,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 07:50:23,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 07:50:23,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 07:50:23,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:50:21" (1/3) ... [2024-11-16 07:50:23,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2def5605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:50:23, skipping insertion in model container [2024-11-16 07:50:23,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:21" (2/3) ... [2024-11-16 07:50:23,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2def5605 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:50:23, skipping insertion in model container [2024-11-16 07:50:23,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:50:23" (3/3) ... [2024-11-16 07:50:23,175 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec9_product31.cil.c [2024-11-16 07:50:23,188 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 07:50:23,188 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 07:50:23,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 07:50:23,271 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;@3482b00b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 07:50:23,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 07:50:23,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 383 states, 299 states have (on average 1.4782608695652173) internal successors, (442), 303 states have internal predecessors, (442), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2024-11-16 07:50:23,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-16 07:50:23,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:23,295 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:23,296 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:23,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:23,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1163125998, now seen corresponding path program 1 times [2024-11-16 07:50:23,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:23,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741873647] [2024-11-16 07:50:23,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:23,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 07:50:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 07:50:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 07:50:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-16 07:50:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 07:50:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 07:50:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 07:50:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 07:50:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 07:50:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 07:50:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-16 07:50:23,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:23,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741873647] [2024-11-16 07:50:23,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741873647] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:50:23,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965315921] [2024-11-16 07:50:23,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:23,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:50:23,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:50:23,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 07:50:23,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 07:50:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 07:50:24,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:50:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-16 07:50:24,306 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:50:24,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965315921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:24,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 07:50:24,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-16 07:50:24,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765979816] [2024-11-16 07:50:24,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:24,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 07:50:24,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:24,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 07:50:24,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 07:50:24,331 INFO L87 Difference]: Start difference. First operand has 383 states, 299 states have (on average 1.4782608695652173) internal successors, (442), 303 states have internal predecessors, (442), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:24,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:24,374 INFO L93 Difference]: Finished difference Result 600 states and 862 transitions. [2024-11-16 07:50:24,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 07:50:24,376 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 102 [2024-11-16 07:50:24,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:24,386 INFO L225 Difference]: With dead ends: 600 [2024-11-16 07:50:24,386 INFO L226 Difference]: Without dead ends: 375 [2024-11-16 07:50:24,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 07:50:24,395 INFO L432 NwaCegarLoop]: 555 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:24,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:50:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-16 07:50:24,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2024-11-16 07:50:24,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 292 states have (on average 1.4726027397260273) internal successors, (430), 295 states have internal predecessors, (430), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-16 07:50:24,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 547 transitions. [2024-11-16 07:50:24,451 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 547 transitions. Word has length 102 [2024-11-16 07:50:24,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:24,453 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 547 transitions. [2024-11-16 07:50:24,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:24,453 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 547 transitions. [2024-11-16 07:50:24,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 07:50:24,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:24,456 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:24,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 07:50:24,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-16 07:50:24,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:24,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:24,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1973286148, now seen corresponding path program 1 times [2024-11-16 07:50:24,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:24,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921979859] [2024-11-16 07:50:24,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:24,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 07:50:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 07:50:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 07:50:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 07:50:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 07:50:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 07:50:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 07:50:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 07:50:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 07:50:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 07:50:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,833 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-16 07:50:24,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:24,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921979859] [2024-11-16 07:50:24,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921979859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:50:24,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911891254] [2024-11-16 07:50:24,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:24,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:50:24,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:50:24,835 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 07:50:24,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 07:50:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 07:50:25,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:50:25,090 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-16 07:50:25,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:50:25,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911891254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:25,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 07:50:25,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-16 07:50:25,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589821972] [2024-11-16 07:50:25,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:25,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:50:25,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:25,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:50:25,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-16 07:50:25,096 INFO L87 Difference]: Start difference. First operand 375 states and 547 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:25,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:25,133 INFO L93 Difference]: Finished difference Result 590 states and 843 transitions. [2024-11-16 07:50:25,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:50:25,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 105 [2024-11-16 07:50:25,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:25,137 INFO L225 Difference]: With dead ends: 590 [2024-11-16 07:50:25,137 INFO L226 Difference]: Without dead ends: 379 [2024-11-16 07:50:25,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-16 07:50:25,139 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 0 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:25,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1090 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:50:25,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-16 07:50:25,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-11-16 07:50:25,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 296 states have (on average 1.4662162162162162) internal successors, (434), 299 states have internal predecessors, (434), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-16 07:50:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 551 transitions. [2024-11-16 07:50:25,158 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 551 transitions. Word has length 105 [2024-11-16 07:50:25,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:25,159 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 551 transitions. [2024-11-16 07:50:25,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:25,160 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 551 transitions. [2024-11-16 07:50:25,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 07:50:25,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:25,162 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:25,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 07:50:25,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-16 07:50:25,369 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:25,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:25,369 INFO L85 PathProgramCache]: Analyzing trace with hash 195571126, now seen corresponding path program 1 times [2024-11-16 07:50:25,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:25,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5158977] [2024-11-16 07:50:25,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:25,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 07:50:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 07:50:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 07:50:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-16 07:50:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 07:50:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 07:50:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 07:50:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 07:50:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-16 07:50:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 07:50:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-16 07:50:25,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:25,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5158977] [2024-11-16 07:50:25,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5158977] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:50:25,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449670133] [2024-11-16 07:50:25,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:25,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:50:25,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:50:25,628 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 07:50:25,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 07:50:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 07:50:25,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:50:25,889 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-16 07:50:25,891 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:50:25,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449670133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:25,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 07:50:25,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-16 07:50:25,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148851245] [2024-11-16 07:50:25,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:25,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:50:25,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:25,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:50:25,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-16 07:50:25,894 INFO L87 Difference]: Start difference. First operand 379 states and 551 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:25,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:25,928 INFO L93 Difference]: Finished difference Result 797 states and 1170 transitions. [2024-11-16 07:50:25,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:50:25,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 113 [2024-11-16 07:50:25,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:25,931 INFO L225 Difference]: With dead ends: 797 [2024-11-16 07:50:25,932 INFO L226 Difference]: Without dead ends: 447 [2024-11-16 07:50:25,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-16 07:50:25,934 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 117 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:25,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1061 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:50:25,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-11-16 07:50:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 439. [2024-11-16 07:50:25,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 345 states have (on average 1.4695652173913043) internal successors, (507), 348 states have internal predecessors, (507), 70 states have call successors, (70), 23 states have call predecessors, (70), 23 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-16 07:50:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 646 transitions. [2024-11-16 07:50:25,952 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 646 transitions. Word has length 113 [2024-11-16 07:50:25,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:25,952 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 646 transitions. [2024-11-16 07:50:25,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:25,952 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 646 transitions. [2024-11-16 07:50:25,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 07:50:25,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:25,954 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:25,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 07:50:26,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:50:26,156 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:26,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:26,156 INFO L85 PathProgramCache]: Analyzing trace with hash 87144804, now seen corresponding path program 1 times [2024-11-16 07:50:26,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:26,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814759415] [2024-11-16 07:50:26,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:26,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 07:50:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 07:50:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 07:50:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 07:50:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 07:50:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 07:50:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 07:50:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 07:50:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 07:50:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 07:50:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-16 07:50:26,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:26,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814759415] [2024-11-16 07:50:26,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814759415] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:50:26,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793835571] [2024-11-16 07:50:26,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:26,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:50:26,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:50:26,335 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 07:50:26,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 07:50:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 07:50:26,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:50:26,646 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-16 07:50:26,646 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:50:26,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793835571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:26,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 07:50:26,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-16 07:50:26,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877073236] [2024-11-16 07:50:26,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:26,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:50:26,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:26,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:50:26,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-16 07:50:26,648 INFO L87 Difference]: Start difference. First operand 439 states and 646 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-16 07:50:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:26,727 INFO L93 Difference]: Finished difference Result 869 states and 1282 transitions. [2024-11-16 07:50:26,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:50:26,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2024-11-16 07:50:26,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:26,735 INFO L225 Difference]: With dead ends: 869 [2024-11-16 07:50:26,735 INFO L226 Difference]: Without dead ends: 441 [2024-11-16 07:50:26,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-16 07:50:26,737 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 2 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2145 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:26,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2145 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:50:26,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-16 07:50:26,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2024-11-16 07:50:26,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 346 states have (on average 1.4682080924855492) internal successors, (508), 350 states have internal predecessors, (508), 70 states have call successors, (70), 23 states have call predecessors, (70), 24 states have return successors, (71), 69 states have call predecessors, (71), 69 states have call successors, (71) [2024-11-16 07:50:26,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 649 transitions. [2024-11-16 07:50:26,770 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 649 transitions. Word has length 114 [2024-11-16 07:50:26,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:26,770 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 649 transitions. [2024-11-16 07:50:26,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-16 07:50:26,771 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 649 transitions. [2024-11-16 07:50:26,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 07:50:26,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:26,773 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:26,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 07:50:26,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:50:26,975 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:26,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:26,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1792612603, now seen corresponding path program 1 times [2024-11-16 07:50:26,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:26,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257271068] [2024-11-16 07:50:26,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:26,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-16 07:50:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:50:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 07:50:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 07:50:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 07:50:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 07:50:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 07:50:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 07:50:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 07:50:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 07:50:27,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:27,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257271068] [2024-11-16 07:50:27,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257271068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:50:27,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781722779] [2024-11-16 07:50:27,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:27,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:50:27,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:50:27,165 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 07:50:27,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-16 07:50:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 07:50:27,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:50:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-16 07:50:27,468 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:50:27,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781722779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:27,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 07:50:27,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-16 07:50:27,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592979988] [2024-11-16 07:50:27,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:27,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:50:27,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:27,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:50:27,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-16 07:50:27,471 INFO L87 Difference]: Start difference. First operand 441 states and 649 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-16 07:50:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:27,522 INFO L93 Difference]: Finished difference Result 871 states and 1287 transitions. [2024-11-16 07:50:27,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:50:27,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 115 [2024-11-16 07:50:27,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:27,525 INFO L225 Difference]: With dead ends: 871 [2024-11-16 07:50:27,525 INFO L226 Difference]: Without dead ends: 443 [2024-11-16 07:50:27,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-16 07:50:27,528 INFO L432 NwaCegarLoop]: 537 mSDtfsCounter, 2 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2131 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:27,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2131 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:50:27,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-16 07:50:27,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2024-11-16 07:50:27,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 347 states have (on average 1.4668587896253602) internal successors, (509), 352 states have internal predecessors, (509), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (76), 69 states have call predecessors, (76), 69 states have call successors, (76) [2024-11-16 07:50:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 655 transitions. [2024-11-16 07:50:27,549 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 655 transitions. Word has length 115 [2024-11-16 07:50:27,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:27,549 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 655 transitions. [2024-11-16 07:50:27,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-16 07:50:27,549 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 655 transitions. [2024-11-16 07:50:27,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-16 07:50:27,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:27,552 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:27,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-16 07:50:27,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:50:27,753 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:27,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:27,754 INFO L85 PathProgramCache]: Analyzing trace with hash 988395491, now seen corresponding path program 1 times [2024-11-16 07:50:27,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:27,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899545171] [2024-11-16 07:50:27,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:27,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 07:50:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 07:50:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 07:50:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 07:50:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 07:50:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 07:50:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 07:50:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 07:50:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-16 07:50:27,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:27,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899545171] [2024-11-16 07:50:27,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899545171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:27,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:27,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 07:50:27,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589541574] [2024-11-16 07:50:27,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:27,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 07:50:27,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:27,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 07:50:27,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 07:50:27,956 INFO L87 Difference]: Start difference. First operand 443 states and 655 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-16 07:50:30,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:30,251 INFO L93 Difference]: Finished difference Result 1050 states and 1555 transitions. [2024-11-16 07:50:30,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 07:50:30,252 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 116 [2024-11-16 07:50:30,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:30,259 INFO L225 Difference]: With dead ends: 1050 [2024-11-16 07:50:30,259 INFO L226 Difference]: Without dead ends: 630 [2024-11-16 07:50:30,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-16 07:50:30,266 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 1273 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 2641 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 3084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:30,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 1196 Invalid, 3084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2641 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-16 07:50:30,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-16 07:50:30,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 443. [2024-11-16 07:50:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 347 states have (on average 1.4668587896253602) internal successors, (509), 352 states have internal predecessors, (509), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (75), 69 states have call predecessors, (75), 69 states have call successors, (75) [2024-11-16 07:50:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 654 transitions. [2024-11-16 07:50:30,302 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 654 transitions. Word has length 116 [2024-11-16 07:50:30,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:30,302 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 654 transitions. [2024-11-16 07:50:30,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-16 07:50:30,303 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 654 transitions. [2024-11-16 07:50:30,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 07:50:30,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:30,304 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:30,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 07:50:30,304 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:30,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:30,305 INFO L85 PathProgramCache]: Analyzing trace with hash -249299496, now seen corresponding path program 2 times [2024-11-16 07:50:30,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:30,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571843338] [2024-11-16 07:50:30,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:30,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 07:50:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 07:50:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 07:50:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 07:50:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 07:50:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 07:50:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 07:50:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 07:50:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-16 07:50:30,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:30,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571843338] [2024-11-16 07:50:30,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571843338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:30,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:30,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 07:50:30,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852455595] [2024-11-16 07:50:30,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:30,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 07:50:30,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:30,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 07:50:30,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 07:50:30,458 INFO L87 Difference]: Start difference. First operand 443 states and 654 transitions. Second operand has 9 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-16 07:50:32,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:32,153 INFO L93 Difference]: Finished difference Result 1052 states and 1558 transitions. [2024-11-16 07:50:32,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 07:50:32,153 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 117 [2024-11-16 07:50:32,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:32,157 INFO L225 Difference]: With dead ends: 1052 [2024-11-16 07:50:32,157 INFO L226 Difference]: Without dead ends: 632 [2024-11-16 07:50:32,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-16 07:50:32,159 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 1285 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 2665 mSolverCounterSat, 424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 3089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 424 IncrementalHoareTripleChecker+Valid, 2665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:32,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 1196 Invalid, 3089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [424 Valid, 2665 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-16 07:50:32,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-16 07:50:32,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 445. [2024-11-16 07:50:32,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 348 states have (on average 1.4655172413793103) internal successors, (510), 354 states have internal predecessors, (510), 70 states have call successors, (70), 23 states have call predecessors, (70), 26 states have return successors, (77), 69 states have call predecessors, (77), 69 states have call successors, (77) [2024-11-16 07:50:32,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 657 transitions. [2024-11-16 07:50:32,181 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 657 transitions. Word has length 117 [2024-11-16 07:50:32,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:32,182 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 657 transitions. [2024-11-16 07:50:32,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-16 07:50:32,182 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 657 transitions. [2024-11-16 07:50:32,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 07:50:32,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:32,183 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:32,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 07:50:32,184 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:32,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:32,184 INFO L85 PathProgramCache]: Analyzing trace with hash -504615648, now seen corresponding path program 1 times [2024-11-16 07:50:32,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:32,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987499644] [2024-11-16 07:50:32,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:32,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:32,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 07:50:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 07:50:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 07:50:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 07:50:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 07:50:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 07:50:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-16 07:50:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,364 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 07:50:32,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:32,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987499644] [2024-11-16 07:50:32,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987499644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:32,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:32,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 07:50:32,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566044974] [2024-11-16 07:50:32,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:32,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 07:50:32,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:32,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 07:50:32,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-16 07:50:32,366 INFO L87 Difference]: Start difference. First operand 445 states and 657 transitions. Second operand has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-16 07:50:34,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:34,698 INFO L93 Difference]: Finished difference Result 1050 states and 1553 transitions. [2024-11-16 07:50:34,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 07:50:34,699 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 118 [2024-11-16 07:50:34,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:34,702 INFO L225 Difference]: With dead ends: 1050 [2024-11-16 07:50:34,703 INFO L226 Difference]: Without dead ends: 632 [2024-11-16 07:50:34,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-16 07:50:34,705 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 1334 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 4224 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 4668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 4224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:34,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 1656 Invalid, 4668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 4224 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-16 07:50:34,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-16 07:50:34,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 445. [2024-11-16 07:50:34,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 348 states have (on average 1.4655172413793103) internal successors, (510), 354 states have internal predecessors, (510), 70 states have call successors, (70), 23 states have call predecessors, (70), 26 states have return successors, (76), 69 states have call predecessors, (76), 69 states have call successors, (76) [2024-11-16 07:50:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 656 transitions. [2024-11-16 07:50:34,727 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 656 transitions. Word has length 118 [2024-11-16 07:50:34,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:34,727 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 656 transitions. [2024-11-16 07:50:34,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-16 07:50:34,728 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 656 transitions. [2024-11-16 07:50:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-16 07:50:34,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:34,729 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:34,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 07:50:34,729 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:34,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:34,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1337743766, now seen corresponding path program 2 times [2024-11-16 07:50:34,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:34,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406057886] [2024-11-16 07:50:34,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:34,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:34,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:34,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:34,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:34,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:34,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:34,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:34,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 07:50:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:34,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 07:50:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:34,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 07:50:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:34,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 07:50:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:34,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-16 07:50:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:34,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 07:50:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:34,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 07:50:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:34,966 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 07:50:34,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:34,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406057886] [2024-11-16 07:50:34,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406057886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:34,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:34,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 07:50:34,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097353534] [2024-11-16 07:50:34,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:34,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 07:50:34,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:34,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 07:50:34,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-16 07:50:34,968 INFO L87 Difference]: Start difference. First operand 445 states and 656 transitions. Second operand has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-16 07:50:37,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:37,299 INFO L93 Difference]: Finished difference Result 1052 states and 1559 transitions. [2024-11-16 07:50:37,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 07:50:37,300 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 119 [2024-11-16 07:50:37,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:37,303 INFO L225 Difference]: With dead ends: 1052 [2024-11-16 07:50:37,303 INFO L226 Difference]: Without dead ends: 634 [2024-11-16 07:50:37,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-16 07:50:37,305 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1276 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 4437 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 4883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 4437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:37,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 1657 Invalid, 4883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 4437 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-16 07:50:37,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-16 07:50:37,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 447. [2024-11-16 07:50:37,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 349 states have (on average 1.4641833810888252) internal successors, (511), 356 states have internal predecessors, (511), 70 states have call successors, (70), 23 states have call predecessors, (70), 27 states have return successors, (81), 69 states have call predecessors, (81), 69 states have call successors, (81) [2024-11-16 07:50:37,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 662 transitions. [2024-11-16 07:50:37,328 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 662 transitions. Word has length 119 [2024-11-16 07:50:37,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:37,328 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 662 transitions. [2024-11-16 07:50:37,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-16 07:50:37,328 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 662 transitions. [2024-11-16 07:50:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 07:50:37,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:37,330 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:37,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 07:50:37,330 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:37,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:37,331 INFO L85 PathProgramCache]: Analyzing trace with hash -596906947, now seen corresponding path program 1 times [2024-11-16 07:50:37,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:37,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501062866] [2024-11-16 07:50:37,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:37,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:37,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:37,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:37,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:37,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:37,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:37,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:37,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 07:50:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:37,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-16 07:50:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:37,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 07:50:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:37,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 07:50:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:37,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 07:50:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:37,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 07:50:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:37,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 07:50:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:37,441 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-16 07:50:37,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:37,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501062866] [2024-11-16 07:50:37,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501062866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:50:37,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854788738] [2024-11-16 07:50:37,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:37,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:50:37,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:50:37,443 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 07:50:37,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-16 07:50:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:37,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 07:50:37,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:50:37,736 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-16 07:50:37,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:50:37,820 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-16 07:50:37,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854788738] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:50:37,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:50:37,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-11-16 07:50:37,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989822219] [2024-11-16 07:50:37,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:50:37,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 07:50:37,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:37,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 07:50:37,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-16 07:50:37,825 INFO L87 Difference]: Start difference. First operand 447 states and 662 transitions. Second operand has 11 states, 11 states have (on average 11.0) internal successors, (121), 7 states have internal predecessors, (121), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 07:50:39,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:39,775 INFO L93 Difference]: Finished difference Result 1254 states and 1920 transitions. [2024-11-16 07:50:39,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 07:50:39,776 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 7 states have internal predecessors, (121), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 120 [2024-11-16 07:50:39,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:39,782 INFO L225 Difference]: With dead ends: 1254 [2024-11-16 07:50:39,783 INFO L226 Difference]: Without dead ends: 1043 [2024-11-16 07:50:39,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-16 07:50:39,786 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 1804 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 2670 mSolverCounterSat, 608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1849 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 3278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 608 IncrementalHoareTripleChecker+Valid, 2670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:39,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1849 Valid, 1525 Invalid, 3278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [608 Valid, 2670 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-16 07:50:39,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2024-11-16 07:50:39,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 832. [2024-11-16 07:50:39,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 670 states have (on average 1.501492537313433) internal successors, (1006), 677 states have internal predecessors, (1006), 134 states have call successors, (134), 23 states have call predecessors, (134), 27 states have return successors, (155), 133 states have call predecessors, (155), 133 states have call successors, (155) [2024-11-16 07:50:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1295 transitions. [2024-11-16 07:50:39,852 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1295 transitions. Word has length 120 [2024-11-16 07:50:39,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:39,852 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1295 transitions. [2024-11-16 07:50:39,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 7 states have internal predecessors, (121), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 07:50:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1295 transitions. [2024-11-16 07:50:39,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 07:50:39,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:39,856 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:39,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-16 07:50:40,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:50:40,058 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:40,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:40,058 INFO L85 PathProgramCache]: Analyzing trace with hash -730337223, now seen corresponding path program 1 times [2024-11-16 07:50:40,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:40,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735012734] [2024-11-16 07:50:40,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:40,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:40,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:40,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:40,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:40,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:40,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:40,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:40,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 07:50:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:40,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 07:50:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:40,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-16 07:50:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:40,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 07:50:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:40,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 07:50:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:40,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 07:50:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:40,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-16 07:50:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:40,192 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-16 07:50:40,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:40,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735012734] [2024-11-16 07:50:40,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735012734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:40,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:40,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 07:50:40,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873525736] [2024-11-16 07:50:40,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:40,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 07:50:40,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:40,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 07:50:40,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:50:40,193 INFO L87 Difference]: Start difference. First operand 832 states and 1295 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:41,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:41,575 INFO L93 Difference]: Finished difference Result 2171 states and 3427 transitions. [2024-11-16 07:50:41,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 07:50:41,575 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 133 [2024-11-16 07:50:41,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:41,584 INFO L225 Difference]: With dead ends: 2171 [2024-11-16 07:50:41,584 INFO L226 Difference]: Without dead ends: 1411 [2024-11-16 07:50:41,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-16 07:50:41,587 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 1397 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1412 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:41,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1412 Valid, 915 Invalid, 2003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 07:50:41,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2024-11-16 07:50:41,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1216. [2024-11-16 07:50:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 990 states have (on average 1.505050505050505) internal successors, (1490), 997 states have internal predecessors, (1490), 198 states have call successors, (198), 23 states have call predecessors, (198), 27 states have return successors, (229), 197 states have call predecessors, (229), 197 states have call successors, (229) [2024-11-16 07:50:41,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1917 transitions. [2024-11-16 07:50:41,667 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1917 transitions. Word has length 133 [2024-11-16 07:50:41,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:41,667 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 1917 transitions. [2024-11-16 07:50:41,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:41,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1917 transitions. [2024-11-16 07:50:41,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 07:50:41,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:41,673 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:41,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 07:50:41,673 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:41,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:41,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1529727321, now seen corresponding path program 1 times [2024-11-16 07:50:41,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:41,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87606541] [2024-11-16 07:50:41,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:41,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:41,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:41,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:41,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:41,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:41,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:41,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:41,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 07:50:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:41,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 07:50:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:41,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 07:50:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:41,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 07:50:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:41,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 07:50:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:41,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 07:50:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:41,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-16 07:50:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:41,782 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-16 07:50:41,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:41,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87606541] [2024-11-16 07:50:41,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87606541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:41,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:41,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 07:50:41,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46541122] [2024-11-16 07:50:41,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:41,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 07:50:41,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:41,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 07:50:41,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:50:41,784 INFO L87 Difference]: Start difference. First operand 1216 states and 1917 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:43,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:43,066 INFO L93 Difference]: Finished difference Result 3098 states and 4923 transitions. [2024-11-16 07:50:43,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 07:50:43,066 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 134 [2024-11-16 07:50:43,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:43,075 INFO L225 Difference]: With dead ends: 3098 [2024-11-16 07:50:43,075 INFO L226 Difference]: Without dead ends: 2015 [2024-11-16 07:50:43,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-16 07:50:43,078 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 1345 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1560 mSolverCounterSat, 476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 2036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 1560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:43,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 910 Invalid, 2036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 1560 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 07:50:43,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2024-11-16 07:50:43,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1820. [2024-11-16 07:50:43,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1820 states, 1499 states have (on average 1.5056704469646431) internal successors, (2257), 1506 states have internal predecessors, (2257), 293 states have call successors, (293), 23 states have call predecessors, (293), 27 states have return successors, (324), 292 states have call predecessors, (324), 292 states have call successors, (324) [2024-11-16 07:50:43,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 2874 transitions. [2024-11-16 07:50:43,163 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 2874 transitions. Word has length 134 [2024-11-16 07:50:43,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:43,163 INFO L471 AbstractCegarLoop]: Abstraction has 1820 states and 2874 transitions. [2024-11-16 07:50:43,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:43,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2874 transitions. [2024-11-16 07:50:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-16 07:50:43,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:43,170 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:43,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 07:50:43,170 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:43,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:43,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1458143943, now seen corresponding path program 1 times [2024-11-16 07:50:43,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:43,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99439677] [2024-11-16 07:50:43,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:43,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:43,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:43,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:43,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:43,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:43,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:43,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:43,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 07:50:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:43,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 07:50:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:43,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 07:50:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:43,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 07:50:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:43,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 07:50:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:43,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-16 07:50:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:43,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 07:50:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:43,276 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-16 07:50:43,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:43,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99439677] [2024-11-16 07:50:43,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99439677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:43,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:43,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 07:50:43,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861121624] [2024-11-16 07:50:43,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:43,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 07:50:43,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:43,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 07:50:43,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:50:43,278 INFO L87 Difference]: Start difference. First operand 1820 states and 2874 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:44,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:44,760 INFO L93 Difference]: Finished difference Result 4485 states and 7167 transitions. [2024-11-16 07:50:44,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 07:50:44,760 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 135 [2024-11-16 07:50:44,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:44,773 INFO L225 Difference]: With dead ends: 4485 [2024-11-16 07:50:44,773 INFO L226 Difference]: Without dead ends: 2941 [2024-11-16 07:50:44,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-16 07:50:44,778 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 1389 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 1526 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1404 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 1526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:44,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1404 Valid, 877 Invalid, 1998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-16 07:50:44,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2024-11-16 07:50:44,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 2746. [2024-11-16 07:50:44,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2746 states, 2302 states have (on average 1.5052128583840139) internal successors, (3465), 2309 states have internal predecessors, (3465), 416 states have call successors, (416), 23 states have call predecessors, (416), 27 states have return successors, (463), 415 states have call predecessors, (463), 415 states have call successors, (463) [2024-11-16 07:50:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2746 states and 4344 transitions. [2024-11-16 07:50:44,893 INFO L78 Accepts]: Start accepts. Automaton has 2746 states and 4344 transitions. Word has length 135 [2024-11-16 07:50:44,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:44,894 INFO L471 AbstractCegarLoop]: Abstraction has 2746 states and 4344 transitions. [2024-11-16 07:50:44,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:44,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2746 states and 4344 transitions. [2024-11-16 07:50:44,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 07:50:44,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:44,902 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:44,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 07:50:44,903 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:44,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:44,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1205360313, now seen corresponding path program 1 times [2024-11-16 07:50:44,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:44,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902209991] [2024-11-16 07:50:44,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:44,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:44,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:44,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:44,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:44,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:44,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:44,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:44,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 07:50:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:44,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 07:50:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:44,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 07:50:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:44,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 07:50:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:44,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-16 07:50:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:44,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 07:50:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:44,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 07:50:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:44,987 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-16 07:50:44,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:44,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902209991] [2024-11-16 07:50:44,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902209991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:44,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:44,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 07:50:44,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22856866] [2024-11-16 07:50:44,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:44,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 07:50:44,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:44,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 07:50:44,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:50:44,989 INFO L87 Difference]: Start difference. First operand 2746 states and 4344 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:46,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:46,315 INFO L93 Difference]: Finished difference Result 6667 states and 10689 transitions. [2024-11-16 07:50:46,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 07:50:46,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 136 [2024-11-16 07:50:46,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:46,334 INFO L225 Difference]: With dead ends: 6667 [2024-11-16 07:50:46,334 INFO L226 Difference]: Without dead ends: 4434 [2024-11-16 07:50:46,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-16 07:50:46,368 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 1347 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 468 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 2020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 468 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:46,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1362 Valid, 877 Invalid, 2020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [468 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 07:50:46,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4434 states. [2024-11-16 07:50:46,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4434 to 4239. [2024-11-16 07:50:46,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4239 states, 3616 states have (on average 1.5033185840707965) internal successors, (5436), 3623 states have internal predecessors, (5436), 595 states have call successors, (595), 23 states have call predecessors, (595), 27 states have return successors, (668), 594 states have call predecessors, (668), 594 states have call successors, (668) [2024-11-16 07:50:46,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4239 states to 4239 states and 6699 transitions. [2024-11-16 07:50:46,479 INFO L78 Accepts]: Start accepts. Automaton has 4239 states and 6699 transitions. Word has length 136 [2024-11-16 07:50:46,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:46,479 INFO L471 AbstractCegarLoop]: Abstraction has 4239 states and 6699 transitions. [2024-11-16 07:50:46,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:46,480 INFO L276 IsEmpty]: Start isEmpty. Operand 4239 states and 6699 transitions. [2024-11-16 07:50:46,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-16 07:50:46,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:46,488 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:46,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 07:50:46,488 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:46,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:46,489 INFO L85 PathProgramCache]: Analyzing trace with hash -953354599, now seen corresponding path program 1 times [2024-11-16 07:50:46,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:46,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700200714] [2024-11-16 07:50:46,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:46,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 07:50:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 07:50:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 07:50:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 07:50:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 07:50:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 07:50:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 07:50:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,576 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-16 07:50:46,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:46,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700200714] [2024-11-16 07:50:46,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700200714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:46,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:46,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 07:50:46,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053155914] [2024-11-16 07:50:46,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:46,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 07:50:46,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:46,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 07:50:46,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:50:46,577 INFO L87 Difference]: Start difference. First operand 4239 states and 6699 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:48,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:48,030 INFO L93 Difference]: Finished difference Result 10287 states and 16508 transitions. [2024-11-16 07:50:48,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 07:50:48,030 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 137 [2024-11-16 07:50:48,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:48,056 INFO L225 Difference]: With dead ends: 10287 [2024-11-16 07:50:48,056 INFO L226 Difference]: Without dead ends: 6926 [2024-11-16 07:50:48,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-16 07:50:48,064 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 1316 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 2104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 482 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:48,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 936 Invalid, 2104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [482 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 07:50:48,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6926 states. [2024-11-16 07:50:48,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6926 to 6731. [2024-11-16 07:50:48,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6731 states, 5732 states have (on average 1.4914515003489184) internal successors, (8549), 5739 states have internal predecessors, (8549), 971 states have call successors, (971), 23 states have call predecessors, (971), 27 states have return successors, (1088), 970 states have call predecessors, (1088), 970 states have call successors, (1088) [2024-11-16 07:50:48,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6731 states to 6731 states and 10608 transitions. [2024-11-16 07:50:48,241 INFO L78 Accepts]: Start accepts. Automaton has 6731 states and 10608 transitions. Word has length 137 [2024-11-16 07:50:48,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:48,241 INFO L471 AbstractCegarLoop]: Abstraction has 6731 states and 10608 transitions. [2024-11-16 07:50:48,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 6731 states and 10608 transitions. [2024-11-16 07:50:48,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-16 07:50:48,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:48,254 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:48,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 07:50:48,254 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:48,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:48,255 INFO L85 PathProgramCache]: Analyzing trace with hash 417109145, now seen corresponding path program 1 times [2024-11-16 07:50:48,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:48,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931936772] [2024-11-16 07:50:48,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:48,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:48,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:48,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:48,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:48,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:48,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:48,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:48,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 07:50:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:48,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 07:50:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:48,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-16 07:50:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:48,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 07:50:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:48,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 07:50:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:48,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 07:50:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:48,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 07:50:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-16 07:50:48,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:48,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931936772] [2024-11-16 07:50:48,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931936772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:48,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:48,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 07:50:48,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775398716] [2024-11-16 07:50:48,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:48,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 07:50:48,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:48,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 07:50:48,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:50:48,340 INFO L87 Difference]: Start difference. First operand 6731 states and 10608 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:49,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:49,772 INFO L93 Difference]: Finished difference Result 16843 states and 26948 transitions. [2024-11-16 07:50:49,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 07:50:49,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 138 [2024-11-16 07:50:49,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:49,848 INFO L225 Difference]: With dead ends: 16843 [2024-11-16 07:50:49,849 INFO L226 Difference]: Without dead ends: 11445 [2024-11-16 07:50:49,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-16 07:50:49,870 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 1342 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1576 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 1576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:49,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1357 Valid, 909 Invalid, 2047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 1576 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 07:50:49,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11445 states. [2024-11-16 07:50:50,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11445 to 11250. [2024-11-16 07:50:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11250 states, 9645 states have (on average 1.4858475894245724) internal successors, (14331), 9652 states have internal predecessors, (14331), 1577 states have call successors, (1577), 23 states have call predecessors, (1577), 27 states have return successors, (1772), 1576 states have call predecessors, (1772), 1576 states have call successors, (1772) [2024-11-16 07:50:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11250 states to 11250 states and 17680 transitions. [2024-11-16 07:50:50,496 INFO L78 Accepts]: Start accepts. Automaton has 11250 states and 17680 transitions. Word has length 138 [2024-11-16 07:50:50,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:50,498 INFO L471 AbstractCegarLoop]: Abstraction has 11250 states and 17680 transitions. [2024-11-16 07:50:50,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:50,498 INFO L276 IsEmpty]: Start isEmpty. Operand 11250 states and 17680 transitions. [2024-11-16 07:50:50,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-16 07:50:50,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:50,530 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:50,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 07:50:50,531 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:50,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:50,531 INFO L85 PathProgramCache]: Analyzing trace with hash -217831527, now seen corresponding path program 1 times [2024-11-16 07:50:50,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:50,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296186071] [2024-11-16 07:50:50,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:50,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:50,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:50,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:50,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:50,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:50,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:50,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:50,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 07:50:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:50,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 07:50:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:50,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 07:50:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:50,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 07:50:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:50,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 07:50:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:50,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 07:50:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:50,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-16 07:50:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:50,610 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-16 07:50:50,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:50,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296186071] [2024-11-16 07:50:50,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296186071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:50,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:50,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 07:50:50,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025759643] [2024-11-16 07:50:50,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:50,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 07:50:50,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:50,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 07:50:50,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:50:50,612 INFO L87 Difference]: Start difference. First operand 11250 states and 17680 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:52,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:52,205 INFO L93 Difference]: Finished difference Result 29320 states and 46787 transitions. [2024-11-16 07:50:52,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 07:50:52,206 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 139 [2024-11-16 07:50:52,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:52,267 INFO L225 Difference]: With dead ends: 29320 [2024-11-16 07:50:52,267 INFO L226 Difference]: Without dead ends: 19963 [2024-11-16 07:50:52,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-16 07:50:52,293 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 1359 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 468 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 2012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 468 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:52,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 944 Invalid, 2012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [468 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-16 07:50:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19963 states. [2024-11-16 07:50:52,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19963 to 19768. [2024-11-16 07:50:52,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19768 states, 16960 states have (on average 1.4762971698113208) internal successors, (25038), 16967 states have internal predecessors, (25038), 2780 states have call successors, (2780), 23 states have call predecessors, (2780), 27 states have return successors, (3119), 2779 states have call predecessors, (3119), 2779 states have call successors, (3119) [2024-11-16 07:50:52,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19768 states to 19768 states and 30937 transitions. [2024-11-16 07:50:52,864 INFO L78 Accepts]: Start accepts. Automaton has 19768 states and 30937 transitions. Word has length 139 [2024-11-16 07:50:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:52,864 INFO L471 AbstractCegarLoop]: Abstraction has 19768 states and 30937 transitions. [2024-11-16 07:50:52,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:52,864 INFO L276 IsEmpty]: Start isEmpty. Operand 19768 states and 30937 transitions. [2024-11-16 07:50:52,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-16 07:50:52,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:52,887 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:52,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 07:50:52,887 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:52,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:52,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1110872775, now seen corresponding path program 1 times [2024-11-16 07:50:52,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:52,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727505141] [2024-11-16 07:50:52,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:52,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:52,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:52,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:52,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:52,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:52,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:52,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:52,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 07:50:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:52,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 07:50:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:52,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 07:50:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:52,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 07:50:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:52,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-16 07:50:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:52,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-16 07:50:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:52,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-16 07:50:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-16 07:50:52,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:52,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727505141] [2024-11-16 07:50:52,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727505141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:52,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:52,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 07:50:52,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176493785] [2024-11-16 07:50:52,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:52,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 07:50:52,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:52,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 07:50:52,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:50:52,980 INFO L87 Difference]: Start difference. First operand 19768 states and 30937 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:54,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:54,719 INFO L93 Difference]: Finished difference Result 52708 states and 83808 transitions. [2024-11-16 07:50:54,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 07:50:54,719 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 140 [2024-11-16 07:50:54,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:54,822 INFO L225 Difference]: With dead ends: 52708 [2024-11-16 07:50:54,822 INFO L226 Difference]: Without dead ends: 35618 [2024-11-16 07:50:54,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-16 07:50:54,868 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1320 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 1601 mSolverCounterSat, 463 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 2064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 1601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:54,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 881 Invalid, 2064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 1601 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 07:50:54,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35618 states. [2024-11-16 07:50:55,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35618 to 35423. [2024-11-16 07:50:55,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35423 states, 30576 states have (on average 1.4698456305599163) internal successors, (44942), 30583 states have internal predecessors, (44942), 4819 states have call successors, (4819), 23 states have call predecessors, (4819), 27 states have return successors, (5432), 4818 states have call predecessors, (5432), 4818 states have call successors, (5432) [2024-11-16 07:50:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35423 states to 35423 states and 55193 transitions. [2024-11-16 07:50:56,070 INFO L78 Accepts]: Start accepts. Automaton has 35423 states and 55193 transitions. Word has length 140 [2024-11-16 07:50:56,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:56,070 INFO L471 AbstractCegarLoop]: Abstraction has 35423 states and 55193 transitions. [2024-11-16 07:50:56,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:56,070 INFO L276 IsEmpty]: Start isEmpty. Operand 35423 states and 55193 transitions. [2024-11-16 07:50:56,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-16 07:50:56,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:56,126 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:56,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 07:50:56,126 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:56,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:56,126 INFO L85 PathProgramCache]: Analyzing trace with hash -887669639, now seen corresponding path program 1 times [2024-11-16 07:50:56,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:56,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241241077] [2024-11-16 07:50:56,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:56,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:56,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:56,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:56,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:56,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:56,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:56,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:56,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 07:50:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:56,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 07:50:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:56,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 07:50:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:56,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 07:50:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:56,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 07:50:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:56,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-16 07:50:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:56,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 07:50:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-16 07:50:56,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:56,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241241077] [2024-11-16 07:50:56,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241241077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:56,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:56,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 07:50:56,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187895218] [2024-11-16 07:50:56,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:56,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 07:50:56,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:56,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 07:50:56,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:50:56,232 INFO L87 Difference]: Start difference. First operand 35423 states and 55193 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:50:58,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:58,552 INFO L93 Difference]: Finished difference Result 97132 states and 153229 transitions. [2024-11-16 07:50:58,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 07:50:58,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 141 [2024-11-16 07:50:58,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:58,760 INFO L225 Difference]: With dead ends: 97132 [2024-11-16 07:50:58,761 INFO L226 Difference]: Without dead ends: 65342 [2024-11-16 07:50:58,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-16 07:50:58,838 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 1369 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 1508 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 1508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:58,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 927 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 1508 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 07:50:58,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65342 states. [2024-11-16 07:51:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65342 to 65147. [2024-11-16 07:51:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65147 states, 56585 states have (on average 1.4625077317310242) internal successors, (82756), 56592 states have internal predecessors, (82756), 8534 states have call successors, (8534), 23 states have call predecessors, (8534), 27 states have return successors, (9679), 8533 states have call predecessors, (9679), 8533 states have call successors, (9679) [2024-11-16 07:51:00,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65147 states to 65147 states and 100969 transitions. [2024-11-16 07:51:01,001 INFO L78 Accepts]: Start accepts. Automaton has 65147 states and 100969 transitions. Word has length 141 [2024-11-16 07:51:01,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:51:01,002 INFO L471 AbstractCegarLoop]: Abstraction has 65147 states and 100969 transitions. [2024-11-16 07:51:01,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:51:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 65147 states and 100969 transitions. [2024-11-16 07:51:01,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-16 07:51:01,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:51:01,023 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:51:01,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 07:51:01,023 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:51:01,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:51:01,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2057354809, now seen corresponding path program 1 times [2024-11-16 07:51:01,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:51:01,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197390386] [2024-11-16 07:51:01,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:51:01,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:51:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:01,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:51:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:01,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:51:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:01,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:51:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:01,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:51:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:01,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:51:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:01,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:51:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:01,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 07:51:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:01,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-16 07:51:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:01,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 07:51:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:01,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-16 07:51:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:01,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-16 07:51:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:01,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 07:51:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:01,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 07:51:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-16 07:51:01,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:51:01,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197390386] [2024-11-16 07:51:01,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197390386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:51:01,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:51:01,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 07:51:01,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066890229] [2024-11-16 07:51:01,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:51:01,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 07:51:01,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:51:01,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 07:51:01,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:51:01,099 INFO L87 Difference]: Start difference. First operand 65147 states and 100969 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:51:04,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:51:04,126 INFO L93 Difference]: Finished difference Result 122515 states and 193028 transitions. [2024-11-16 07:51:04,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 07:51:04,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 142 [2024-11-16 07:51:04,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:51:04,500 INFO L225 Difference]: With dead ends: 122515 [2024-11-16 07:51:04,501 INFO L226 Difference]: Without dead ends: 122304 [2024-11-16 07:51:04,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-16 07:51:04,539 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 1328 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 2029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-16 07:51:04,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 918 Invalid, 2029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-16 07:51:04,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122304 states. [2024-11-16 07:51:07,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122304 to 122109. [2024-11-16 07:51:07,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122109 states, 106748 states have (on average 1.4541630756548132) internal successors, (155229), 106755 states have internal predecessors, (155229), 15333 states have call successors, (15333), 23 states have call predecessors, (15333), 27 states have return successors, (17524), 15332 states have call predecessors, (17524), 15332 states have call successors, (17524) [2024-11-16 07:51:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122109 states to 122109 states and 188086 transitions. [2024-11-16 07:51:08,404 INFO L78 Accepts]: Start accepts. Automaton has 122109 states and 188086 transitions. Word has length 142 [2024-11-16 07:51:08,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:51:08,405 INFO L471 AbstractCegarLoop]: Abstraction has 122109 states and 188086 transitions. [2024-11-16 07:51:08,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 07:51:08,405 INFO L276 IsEmpty]: Start isEmpty. Operand 122109 states and 188086 transitions. [2024-11-16 07:51:08,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 07:51:08,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:51:08,443 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:51:08,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 07:51:08,443 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:51:08,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:51:08,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1960620711, now seen corresponding path program 1 times [2024-11-16 07:51:08,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:51:08,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94139102] [2024-11-16 07:51:08,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:51:08,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:51:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:08,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:51:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:08,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:51:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:08,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:51:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:08,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:51:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:08,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:51:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:08,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:51:08,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:08,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 07:51:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:08,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 07:51:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:08,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 07:51:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:08,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 07:51:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:08,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 07:51:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:08,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 07:51:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:08,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 07:51:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-16 07:51:08,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:51:08,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94139102] [2024-11-16 07:51:08,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94139102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:51:08,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:51:08,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-16 07:51:08,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509962149] [2024-11-16 07:51:08,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:51:08,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-16 07:51:08,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:51:08,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-16 07:51:08,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2024-11-16 07:51:08,859 INFO L87 Difference]: Start difference. First operand 122109 states and 188086 transitions. Second operand has 18 states, 16 states have (on average 6.375) internal successors, (102), 12 states have internal predecessors, (102), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-16 07:51:19,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:51:19,436 INFO L93 Difference]: Finished difference Result 244254 states and 388196 transitions. [2024-11-16 07:51:19,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-16 07:51:19,436 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.375) internal successors, (102), 12 states have internal predecessors, (102), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 143 [2024-11-16 07:51:19,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:51:20,430 INFO L225 Difference]: With dead ends: 244254 [2024-11-16 07:51:20,430 INFO L226 Difference]: Without dead ends: 244049 [2024-11-16 07:51:20,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1384 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=900, Invalid=4070, Unknown=0, NotChecked=0, Total=4970 [2024-11-16 07:51:20,504 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 5398 mSDsluCounter, 2939 mSDsCounter, 0 mSdLazyCounter, 9403 mSolverCounterSat, 1857 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5398 SdHoareTripleChecker+Valid, 3183 SdHoareTripleChecker+Invalid, 11260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1857 IncrementalHoareTripleChecker+Valid, 9403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:51:20,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5398 Valid, 3183 Invalid, 11260 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1857 Valid, 9403 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-16 07:51:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244049 states. [2024-11-16 07:51:28,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244049 to 243186. [2024-11-16 07:51:28,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243186 states, 212638 states have (on average 1.45495631072527) internal successors, (309379), 212543 states have internal predecessors, (309379), 30476 states have call successors, (30476), 62 states have call predecessors, (30476), 71 states have return successors, (38135), 30586 states have call predecessors, (38135), 30473 states have call successors, (38135) [2024-11-16 07:51:29,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243186 states to 243186 states and 377990 transitions. [2024-11-16 07:51:29,177 INFO L78 Accepts]: Start accepts. Automaton has 243186 states and 377990 transitions. Word has length 143 [2024-11-16 07:51:29,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:51:29,177 INFO L471 AbstractCegarLoop]: Abstraction has 243186 states and 377990 transitions. [2024-11-16 07:51:29,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.375) internal successors, (102), 12 states have internal predecessors, (102), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-16 07:51:29,177 INFO L276 IsEmpty]: Start isEmpty. Operand 243186 states and 377990 transitions. [2024-11-16 07:51:29,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 07:51:29,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:51:29,229 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:51:29,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 07:51:29,229 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:51:29,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:51:29,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2840811, now seen corresponding path program 1 times [2024-11-16 07:51:29,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:51:29,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998388523] [2024-11-16 07:51:29,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:51:29,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:51:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:29,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:51:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:29,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:51:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:29,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:51:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:29,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:51:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:29,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:51:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:29,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:51:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:29,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 07:51:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:29,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 07:51:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:29,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 07:51:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:29,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 07:51:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:29,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 07:51:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:29,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 07:51:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:29,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 07:51:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:29,906 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-16 07:51:29,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:51:29,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998388523] [2024-11-16 07:51:29,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998388523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:51:29,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:51:29,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 07:51:29,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303731845] [2024-11-16 07:51:29,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:51:29,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 07:51:29,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:51:29,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 07:51:29,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 07:51:29,908 INFO L87 Difference]: Start difference. First operand 243186 states and 377990 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13)