./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product31.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_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-dev-4a390ef-m [2024-10-24 00:57:57,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 00:57:57,320 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 00:57:57,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 00:57:57,334 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 00:57:57,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 00:57:57,365 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 00:57:57,365 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 00:57:57,366 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 00:57:57,366 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 00:57:57,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 00:57:57,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 00:57:57,367 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 00:57:57,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 00:57:57,368 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 00:57:57,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 00:57:57,370 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 00:57:57,370 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 00:57:57,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 00:57:57,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 00:57:57,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 00:57:57,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 00:57:57,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 00:57:57,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 00:57:57,374 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 00:57:57,375 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 00:57:57,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 00:57:57,375 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 00:57:57,375 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 00:57:57,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 00:57:57,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 00:57:57,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 00:57:57,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:57:57,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 00:57:57,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 00:57:57,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 00:57:57,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 00:57:57,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 00:57:57,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 00:57:57,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 00:57:57,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 00:57:57,377 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 00:57:57,377 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-10-24 00:57:57,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 00:57:57,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 00:57:57,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 00:57:57,590 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 00:57:57,590 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 00:57:57,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product31.cil.c [2024-10-24 00:57:58,847 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 00:57:59,067 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 00:57:59,068 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product31.cil.c [2024-10-24 00:57:59,085 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b6d90588/1694ee9bda254672892031c3eda866c9/FLAG6fd411f9c [2024-10-24 00:57:59,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b6d90588/1694ee9bda254672892031c3eda866c9 [2024-10-24 00:57:59,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 00:57:59,098 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 00:57:59,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 00:57:59,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 00:57:59,107 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 00:57:59,107 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:57:59" (1/1) ... [2024-10-24 00:57:59,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f77b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:59, skipping insertion in model container [2024-10-24 00:57:59,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:57:59" (1/1) ... [2024-10-24 00:57:59,146 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 00:57:59,547 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product31.cil.c[56976,56989] [2024-10-24 00:57:59,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:57:59,588 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 00:57:59,595 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2024-10-24 00:57:59,597 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [66] [2024-10-24 00:57:59,597 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [115] [2024-10-24 00:57:59,597 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [527] [2024-10-24 00:57:59,597 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [752] [2024-10-24 00:57:59,598 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1118] [2024-10-24 00:57:59,598 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2198] [2024-10-24 00:57:59,598 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2565] [2024-10-24 00:57:59,599 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2574] [2024-10-24 00:57:59,599 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [2849] [2024-10-24 00:57:59,599 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2891] [2024-10-24 00:57:59,667 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product31.cil.c[56976,56989] [2024-10-24 00:57:59,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:57:59,706 INFO L204 MainTranslator]: Completed translation [2024-10-24 00:57:59,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:59 WrapperNode [2024-10-24 00:57:59,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 00:57:59,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 00:57:59,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 00:57:59,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 00:57:59,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:59" (1/1) ... [2024-10-24 00:57:59,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:59" (1/1) ... [2024-10-24 00:57:59,776 INFO L138 Inliner]: procedures = 132, calls = 207, calls flagged for inlining = 62, calls inlined = 57, statements flattened = 1043 [2024-10-24 00:57:59,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 00:57:59,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 00:57:59,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 00:57:59,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 00:57:59,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:59" (1/1) ... [2024-10-24 00:57:59,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:59" (1/1) ... [2024-10-24 00:57:59,791 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:59" (1/1) ... [2024-10-24 00:57:59,819 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-10-24 00:57:59,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:59" (1/1) ... [2024-10-24 00:57:59,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:59" (1/1) ... [2024-10-24 00:57:59,837 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:59" (1/1) ... [2024-10-24 00:57:59,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:59" (1/1) ... [2024-10-24 00:57:59,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:59" (1/1) ... [2024-10-24 00:57:59,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:59" (1/1) ... [2024-10-24 00:57:59,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 00:57:59,862 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 00:57:59,862 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 00:57:59,862 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 00:57:59,862 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:59" (1/1) ... [2024-10-24 00:57:59,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:57:59,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:57:59,893 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 00:57:59,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 00:57:59,934 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-10-24 00:57:59,934 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-10-24 00:57:59,934 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-10-24 00:57:59,934 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-10-24 00:57:59,934 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-10-24 00:57:59,934 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-10-24 00:57:59,934 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-24 00:57:59,935 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-24 00:57:59,935 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-24 00:57:59,935 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-24 00:57:59,935 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-24 00:57:59,936 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-24 00:57:59,936 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-24 00:57:59,936 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-24 00:57:59,936 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-10-24 00:57:59,936 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-10-24 00:57:59,936 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-24 00:57:59,937 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-24 00:57:59,938 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-24 00:57:59,938 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-24 00:57:59,938 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-24 00:57:59,938 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-24 00:57:59,938 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-24 00:57:59,938 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-24 00:57:59,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 00:57:59,938 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-24 00:57:59,938 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-24 00:57:59,938 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-24 00:57:59,938 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-24 00:57:59,938 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-24 00:57:59,938 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-24 00:57:59,938 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-24 00:57:59,939 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-24 00:57:59,939 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-24 00:57:59,939 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-24 00:57:59,939 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-10-24 00:57:59,939 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-10-24 00:57:59,939 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-24 00:57:59,939 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-24 00:57:59,939 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-10-24 00:57:59,940 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-10-24 00:57:59,940 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-24 00:57:59,940 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-24 00:57:59,940 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-24 00:57:59,940 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-24 00:57:59,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 00:57:59,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 00:57:59,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 00:57:59,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 00:57:59,941 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-24 00:57:59,941 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-24 00:57:59,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 00:57:59,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 00:58:00,123 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 00:58:00,125 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 00:58:00,855 INFO L? ?]: Removed 479 outVars from TransFormulas that were not future-live. [2024-10-24 00:58:00,855 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 00:58:00,913 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 00:58:00,913 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 00:58:00,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:58:00 BoogieIcfgContainer [2024-10-24 00:58:00,914 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 00:58:00,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 00:58:00,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 00:58:00,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 00:58:00,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:57:59" (1/3) ... [2024-10-24 00:58:00,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551d6f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:58:00, skipping insertion in model container [2024-10-24 00:58:00,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:59" (2/3) ... [2024-10-24 00:58:00,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551d6f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:58:00, skipping insertion in model container [2024-10-24 00:58:00,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:58:00" (3/3) ... [2024-10-24 00:58:00,922 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec9_product31.cil.c [2024-10-24 00:58:00,934 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 00:58:00,934 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 00:58:00,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 00:58:01,000 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;@6439597f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 00:58:01,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 00:58:01,007 INFO L276 IsEmpty]: Start isEmpty. Operand has 338 states, 254 states have (on average 1.562992125984252) internal successors, (397), 258 states have internal predecessors, (397), 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-10-24 00:58:01,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 00:58:01,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:01,020 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] [2024-10-24 00:58:01,020 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:01,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:01,025 INFO L85 PathProgramCache]: Analyzing trace with hash 750271807, now seen corresponding path program 1 times [2024-10-24 00:58:01,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:01,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351190461] [2024-10-24 00:58:01,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:01,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:58:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:58:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:58:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 00:58:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 00:58:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:58:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:58:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:58:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:58:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:58:01,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:58:01,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:01,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351190461] [2024-10-24 00:58:01,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351190461] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:58:01,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738784652] [2024-10-24 00:58:01,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:01,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:58:01,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:58:01,635 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:58:01,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 00:58:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 00:58:01,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:58:01,902 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:58:01,902 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:58:01,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738784652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:01,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:58:01,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-24 00:58:01,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476257639] [2024-10-24 00:58:01,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:01,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 00:58:01,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:01,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 00:58:01,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:58:01,933 INFO L87 Difference]: Start difference. First operand has 338 states, 254 states have (on average 1.562992125984252) internal successors, (397), 258 states have internal predecessors, (397), 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 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-10-24 00:58:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:02,019 INFO L93 Difference]: Finished difference Result 531 states and 793 transitions. [2024-10-24 00:58:02,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 00:58:02,021 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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 95 [2024-10-24 00:58:02,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:02,036 INFO L225 Difference]: With dead ends: 531 [2024-10-24 00:58:02,036 INFO L226 Difference]: Without dead ends: 335 [2024-10-24 00:58:02,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:58:02,046 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:02,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 494 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:58:02,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-10-24 00:58:02,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2024-10-24 00:58:02,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 252 states have (on average 1.5476190476190477) internal successors, (390), 255 states have internal predecessors, (390), 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-10-24 00:58:02,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 507 transitions. [2024-10-24 00:58:02,114 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 507 transitions. Word has length 95 [2024-10-24 00:58:02,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:02,116 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 507 transitions. [2024-10-24 00:58:02,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-10-24 00:58:02,116 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 507 transitions. [2024-10-24 00:58:02,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 00:58:02,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:02,121 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] [2024-10-24 00:58:02,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 00:58:02,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-24 00:58:02,322 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:02,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:02,323 INFO L85 PathProgramCache]: Analyzing trace with hash 136250808, now seen corresponding path program 1 times [2024-10-24 00:58:02,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:02,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846075262] [2024-10-24 00:58:02,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:02,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:02,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:02,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:02,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:02,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:58:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:02,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:58:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:02,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:58:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:02,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:58:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:02,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 00:58:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:02,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:58:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:02,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:58:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:02,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:58:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:02,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:58:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:02,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:58:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:02,592 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:58:02,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:02,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846075262] [2024-10-24 00:58:02,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846075262] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:58:02,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104941747] [2024-10-24 00:58:02,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:02,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:58:02,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:58:02,595 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:58:02,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 00:58:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:02,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 1008 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 00:58:02,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:58:02,838 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:58:02,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:58:02,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104941747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:02,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:58:02,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 00:58:02,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999991687] [2024-10-24 00:58:02,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:02,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:58:02,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:02,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:58:02,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:58:02,840 INFO L87 Difference]: Start difference. First operand 335 states and 507 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-10-24 00:58:02,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:02,894 INFO L93 Difference]: Finished difference Result 527 states and 780 transitions. [2024-10-24 00:58:02,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:58:02,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 96 [2024-10-24 00:58:02,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:02,898 INFO L225 Difference]: With dead ends: 527 [2024-10-24 00:58:02,898 INFO L226 Difference]: Without dead ends: 337 [2024-10-24 00:58:02,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 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-10-24 00:58:02,900 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 0 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:02,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 981 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:58:02,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-24 00:58:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2024-10-24 00:58:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 254 states have (on average 1.5433070866141732) internal successors, (392), 257 states have internal predecessors, (392), 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-10-24 00:58:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 509 transitions. [2024-10-24 00:58:02,918 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 509 transitions. Word has length 96 [2024-10-24 00:58:02,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:02,918 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 509 transitions. [2024-10-24 00:58:02,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-10-24 00:58:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 509 transitions. [2024-10-24 00:58:02,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 00:58:02,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:02,923 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:02,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 00:58:03,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-24 00:58:03,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:03,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:03,125 INFO L85 PathProgramCache]: Analyzing trace with hash 282368186, now seen corresponding path program 1 times [2024-10-24 00:58:03,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:03,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959124027] [2024-10-24 00:58:03,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:03,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:58:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:58:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:58:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 00:58:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:58:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:58:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:58:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:58:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:58:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:58:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:58:03,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:03,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959124027] [2024-10-24 00:58:03,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959124027] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:58:03,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072869334] [2024-10-24 00:58:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:03,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:58:03,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:58:03,346 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:58:03,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 00:58:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:58:03,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:58:03,596 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:58:03,596 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:58:03,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072869334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:03,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:58:03,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 00:58:03,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059430660] [2024-10-24 00:58:03,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:03,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:58:03,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:03,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:58:03,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:58:03,598 INFO L87 Difference]: Start difference. First operand 337 states and 509 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-10-24 00:58:03,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:03,639 INFO L93 Difference]: Finished difference Result 704 states and 1077 transitions. [2024-10-24 00:58:03,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:58:03,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 101 [2024-10-24 00:58:03,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:03,641 INFO L225 Difference]: With dead ends: 704 [2024-10-24 00:58:03,641 INFO L226 Difference]: Without dead ends: 389 [2024-10-24 00:58:03,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 122 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-10-24 00:58:03,643 INFO L432 NwaCegarLoop]: 503 mSDtfsCounter, 102 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:03,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 949 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:58:03,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-24 00:58:03,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 384. [2024-10-24 00:58:03,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 290 states have (on average 1.5586206896551724) internal successors, (452), 293 states have internal predecessors, (452), 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-10-24 00:58:03,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 591 transitions. [2024-10-24 00:58:03,658 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 591 transitions. Word has length 101 [2024-10-24 00:58:03,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:03,658 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 591 transitions. [2024-10-24 00:58:03,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-10-24 00:58:03,659 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 591 transitions. [2024-10-24 00:58:03,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 00:58:03,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:03,661 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:03,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 00:58:03,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:58:03,862 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:03,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:03,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1081976845, now seen corresponding path program 1 times [2024-10-24 00:58:03,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:03,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072063633] [2024-10-24 00:58:03,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:03,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:58:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:58:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:58:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 00:58:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:58:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:58:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:58:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:58:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:58:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:58:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,042 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:58:04,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:04,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072063633] [2024-10-24 00:58:04,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072063633] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:58:04,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52066855] [2024-10-24 00:58:04,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:04,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:58:04,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:58:04,045 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:58:04,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 00:58:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 00:58:04,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:58:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 00:58:04,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:58:04,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52066855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:04,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:58:04,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-24 00:58:04,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198264236] [2024-10-24 00:58:04,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:04,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:58:04,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:04,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:58:04,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:58:04,324 INFO L87 Difference]: Start difference. First operand 384 states and 591 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-10-24 00:58:04,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:04,427 INFO L93 Difference]: Finished difference Result 763 states and 1176 transitions. [2024-10-24 00:58:04,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:58:04,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 102 [2024-10-24 00:58:04,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:04,431 INFO L225 Difference]: With dead ends: 763 [2024-10-24 00:58:04,431 INFO L226 Difference]: Without dead ends: 386 [2024-10-24 00:58:04,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:58:04,436 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 2 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1921 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:04,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1921 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:58:04,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-10-24 00:58:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2024-10-24 00:58:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 291 states have (on average 1.556701030927835) internal successors, (453), 295 states have internal predecessors, (453), 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-10-24 00:58:04,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 594 transitions. [2024-10-24 00:58:04,455 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 594 transitions. Word has length 102 [2024-10-24 00:58:04,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:04,455 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 594 transitions. [2024-10-24 00:58:04,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-10-24 00:58:04,455 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 594 transitions. [2024-10-24 00:58:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 00:58:04,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:04,458 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:04,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 00:58:04,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:58:04,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:04,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:04,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1193793194, now seen corresponding path program 1 times [2024-10-24 00:58:04,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:04,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910690256] [2024-10-24 00:58:04,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:04,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 00:58:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 00:58:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 00:58:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:58:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:58:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:58:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:58:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:58:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:58:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,844 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:58:04,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:04,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910690256] [2024-10-24 00:58:04,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910690256] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:58:04,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489849036] [2024-10-24 00:58:04,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:04,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:58:04,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:58:04,846 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:58:04,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 00:58:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:05,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 00:58:05,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:58:05,099 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 00:58:05,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:58:05,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489849036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:05,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:58:05,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-24 00:58:05,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121426234] [2024-10-24 00:58:05,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:05,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:58:05,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:05,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:58:05,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:58:05,101 INFO L87 Difference]: Start difference. First operand 386 states and 594 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-10-24 00:58:05,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:05,213 INFO L93 Difference]: Finished difference Result 765 states and 1181 transitions. [2024-10-24 00:58:05,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:58:05,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 103 [2024-10-24 00:58:05,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:05,216 INFO L225 Difference]: With dead ends: 765 [2024-10-24 00:58:05,216 INFO L226 Difference]: Without dead ends: 388 [2024-10-24 00:58:05,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:58:05,217 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 2 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1907 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:05,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1907 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:58:05,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-24 00:58:05,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2024-10-24 00:58:05,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 292 states have (on average 1.5547945205479452) internal successors, (454), 297 states have internal predecessors, (454), 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-10-24 00:58:05,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 600 transitions. [2024-10-24 00:58:05,230 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 600 transitions. Word has length 103 [2024-10-24 00:58:05,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:05,231 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 600 transitions. [2024-10-24 00:58:05,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-10-24 00:58:05,231 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 600 transitions. [2024-10-24 00:58:05,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 00:58:05,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:05,233 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:05,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-24 00:58:05,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:58:05,434 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:05,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:05,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1187952868, now seen corresponding path program 1 times [2024-10-24 00:58:05,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:05,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673946703] [2024-10-24 00:58:05,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:05,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:05,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:05,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:05,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:05,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:05,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:05,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 00:58:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:05,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 00:58:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:05,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:58:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:05,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:58:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:05,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:58:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:05,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:58:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:05,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:58:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:05,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:58:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:58:05,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:05,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673946703] [2024-10-24 00:58:05,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673946703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:05,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:05,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:58:05,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077091148] [2024-10-24 00:58:05,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:05,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:58:05,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:05,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:58:05,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:58:05,570 INFO L87 Difference]: Start difference. First operand 388 states and 600 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (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-10-24 00:58:07,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:07,208 INFO L93 Difference]: Finished difference Result 901 states and 1406 transitions. [2024-10-24 00:58:07,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:58:07,208 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (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 104 [2024-10-24 00:58:07,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:07,211 INFO L225 Difference]: With dead ends: 901 [2024-10-24 00:58:07,212 INFO L226 Difference]: Without dead ends: 532 [2024-10-24 00:58:07,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:58:07,213 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1172 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2499 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 2499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:07,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 968 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 2499 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 00:58:07,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-10-24 00:58:07,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 388. [2024-10-24 00:58:07,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 292 states have (on average 1.5547945205479452) internal successors, (454), 297 states have internal predecessors, (454), 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-10-24 00:58:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 599 transitions. [2024-10-24 00:58:07,239 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 599 transitions. Word has length 104 [2024-10-24 00:58:07,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:07,239 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 599 transitions. [2024-10-24 00:58:07,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (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-10-24 00:58:07,240 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 599 transitions. [2024-10-24 00:58:07,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 00:58:07,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:07,241 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:07,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 00:58:07,241 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:07,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:07,241 INFO L85 PathProgramCache]: Analyzing trace with hash -173704889, now seen corresponding path program 2 times [2024-10-24 00:58:07,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:07,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511325574] [2024-10-24 00:58:07,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:07,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 00:58:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 00:58:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 00:58:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:58:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:58:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:58:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:58:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:58:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:58:07,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:07,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511325574] [2024-10-24 00:58:07,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511325574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:07,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:07,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:58:07,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235191923] [2024-10-24 00:58:07,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:07,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:58:07,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:07,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:58:07,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:58:07,416 INFO L87 Difference]: Start difference. First operand 388 states and 599 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 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-10-24 00:58:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:09,041 INFO L93 Difference]: Finished difference Result 903 states and 1409 transitions. [2024-10-24 00:58:09,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:58:09,042 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 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 105 [2024-10-24 00:58:09,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:09,045 INFO L225 Difference]: With dead ends: 903 [2024-10-24 00:58:09,045 INFO L226 Difference]: Without dead ends: 534 [2024-10-24 00:58:09,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:58:09,050 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1144 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:09,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 968 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 2555 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 00:58:09,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-10-24 00:58:09,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 390. [2024-10-24 00:58:09,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 293 states have (on average 1.552901023890785) internal successors, (455), 299 states have internal predecessors, (455), 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-10-24 00:58:09,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 602 transitions. [2024-10-24 00:58:09,079 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 602 transitions. Word has length 105 [2024-10-24 00:58:09,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:09,079 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 602 transitions. [2024-10-24 00:58:09,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 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-10-24 00:58:09,079 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 602 transitions. [2024-10-24 00:58:09,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 00:58:09,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:09,082 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:09,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 00:58:09,082 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:09,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:09,082 INFO L85 PathProgramCache]: Analyzing trace with hash -873698793, now seen corresponding path program 1 times [2024-10-24 00:58:09,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:09,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307978355] [2024-10-24 00:58:09,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:09,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:58:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 00:58:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:58:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:58:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:58:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:58:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:58:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,262 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:58:09,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:09,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307978355] [2024-10-24 00:58:09,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307978355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:09,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:09,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:58:09,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16403587] [2024-10-24 00:58:09,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:09,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:58:09,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:09,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:58:09,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:58:09,263 INFO L87 Difference]: Start difference. First operand 390 states and 602 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (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-10-24 00:58:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:11,274 INFO L93 Difference]: Finished difference Result 901 states and 1404 transitions. [2024-10-24 00:58:11,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:58:11,275 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (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 106 [2024-10-24 00:58:11,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:11,279 INFO L225 Difference]: With dead ends: 901 [2024-10-24 00:58:11,281 INFO L226 Difference]: Without dead ends: 534 [2024-10-24 00:58:11,282 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-10-24 00:58:11,285 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 1151 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 4158 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 4604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 4158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:11,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 1343 Invalid, 4604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 4158 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 00:58:11,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-10-24 00:58:11,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 390. [2024-10-24 00:58:11,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 293 states have (on average 1.552901023890785) internal successors, (455), 299 states have internal predecessors, (455), 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-10-24 00:58:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 601 transitions. [2024-10-24 00:58:11,310 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 601 transitions. Word has length 106 [2024-10-24 00:58:11,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:11,310 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 601 transitions. [2024-10-24 00:58:11,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (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-10-24 00:58:11,310 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 601 transitions. [2024-10-24 00:58:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 00:58:11,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:11,312 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:11,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 00:58:11,313 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:11,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:11,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1495561951, now seen corresponding path program 2 times [2024-10-24 00:58:11,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:11,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465120522] [2024-10-24 00:58:11,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:11,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:11,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:11,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:11,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:11,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:11,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:11,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:11,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:58:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:11,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 00:58:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:11,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:58:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:11,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:58:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:11,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:58:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:11,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:58:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:11,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:58:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:11,493 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:58:11,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:11,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465120522] [2024-10-24 00:58:11,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465120522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:11,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:11,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:58:11,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445540178] [2024-10-24 00:58:11,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:11,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:58:11,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:11,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:58:11,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:58:11,495 INFO L87 Difference]: Start difference. First operand 390 states and 601 transitions. Second operand has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 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-10-24 00:58:13,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:13,308 INFO L93 Difference]: Finished difference Result 903 states and 1410 transitions. [2024-10-24 00:58:13,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:58:13,309 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 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 107 [2024-10-24 00:58:13,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:13,312 INFO L225 Difference]: With dead ends: 903 [2024-10-24 00:58:13,312 INFO L226 Difference]: Without dead ends: 536 [2024-10-24 00:58:13,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-24 00:58:13,316 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 1187 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 4128 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 4564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 4128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:13,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 1344 Invalid, 4564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 4128 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 00:58:13,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-10-24 00:58:13,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 392. [2024-10-24 00:58:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 294 states have (on average 1.5510204081632653) internal successors, (456), 301 states have internal predecessors, (456), 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-10-24 00:58:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 607 transitions. [2024-10-24 00:58:13,338 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 607 transitions. Word has length 107 [2024-10-24 00:58:13,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:13,339 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 607 transitions. [2024-10-24 00:58:13,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 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-10-24 00:58:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 607 transitions. [2024-10-24 00:58:13,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 00:58:13,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:13,341 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:13,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 00:58:13,341 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:13,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:13,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2129399566, now seen corresponding path program 1 times [2024-10-24 00:58:13,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:13,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973520320] [2024-10-24 00:58:13,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:13,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:58:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 00:58:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:58:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:58:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:58:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:58:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:58:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,451 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:13,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:13,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973520320] [2024-10-24 00:58:13,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973520320] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:58:13,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141291041] [2024-10-24 00:58:13,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:13,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:58:13,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:58:13,453 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:58:13,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 00:58:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:58:13,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:58:13,734 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:13,735 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:58:13,818 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:13,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141291041] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:58:13,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:58:13,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-10-24 00:58:13,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622211272] [2024-10-24 00:58:13,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:58:13,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 00:58:13,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:13,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 00:58:13,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:58:13,820 INFO L87 Difference]: Start difference. First operand 392 states and 607 transitions. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 7 states have internal predecessors, (102), 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-10-24 00:58:15,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:15,130 INFO L93 Difference]: Finished difference Result 1056 states and 1722 transitions. [2024-10-24 00:58:15,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 00:58:15,131 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 7 states have internal predecessors, (102), 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 108 [2024-10-24 00:58:15,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:15,136 INFO L225 Difference]: With dead ends: 1056 [2024-10-24 00:58:15,136 INFO L226 Difference]: Without dead ends: 866 [2024-10-24 00:58:15,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:58:15,138 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 1578 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 594 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1623 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 594 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:15,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1623 Valid, 1309 Invalid, 2673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [594 Valid, 2079 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 00:58:15,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2024-10-24 00:58:15,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 707. [2024-10-24 00:58:15,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 545 states have (on average 1.61651376146789) internal successors, (881), 552 states have internal predecessors, (881), 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-10-24 00:58:15,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1170 transitions. [2024-10-24 00:58:15,191 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1170 transitions. Word has length 108 [2024-10-24 00:58:15,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:15,192 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1170 transitions. [2024-10-24 00:58:15,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 7 states have internal predecessors, (102), 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-10-24 00:58:15,192 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1170 transitions. [2024-10-24 00:58:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 00:58:15,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:15,195 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] [2024-10-24 00:58:15,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-24 00:58:15,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:58:15,396 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:15,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:15,396 INFO L85 PathProgramCache]: Analyzing trace with hash 309673589, now seen corresponding path program 1 times [2024-10-24 00:58:15,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:15,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753774421] [2024-10-24 00:58:15,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:15,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:58:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:58:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:58:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:58:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:58:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:58:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 00:58:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:15,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:15,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753774421] [2024-10-24 00:58:15,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753774421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:15,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:15,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:58:15,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257941215] [2024-10-24 00:58:15,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:15,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:58:15,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:15,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:58:15,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:58:15,484 INFO L87 Difference]: Start difference. First operand 707 states and 1170 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (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-10-24 00:58:16,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:16,587 INFO L93 Difference]: Finished difference Result 1815 states and 3071 transitions. [2024-10-24 00:58:16,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:58:16,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (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 114 [2024-10-24 00:58:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:16,596 INFO L225 Difference]: With dead ends: 1815 [2024-10-24 00:58:16,596 INFO L226 Difference]: Without dead ends: 1168 [2024-10-24 00:58:16,598 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-10-24 00:58:16,599 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 1243 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:16,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 760 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:58:16,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2024-10-24 00:58:16,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1019. [2024-10-24 00:58:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 793 states have (on average 1.630517023959647) internal successors, (1293), 800 states have internal predecessors, (1293), 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-10-24 00:58:16,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1720 transitions. [2024-10-24 00:58:16,638 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1720 transitions. Word has length 114 [2024-10-24 00:58:16,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:16,638 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1720 transitions. [2024-10-24 00:58:16,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (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-10-24 00:58:16,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1720 transitions. [2024-10-24 00:58:16,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 00:58:16,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:16,643 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] [2024-10-24 00:58:16,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 00:58:16,643 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:16,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:16,643 INFO L85 PathProgramCache]: Analyzing trace with hash 568437877, now seen corresponding path program 1 times [2024-10-24 00:58:16,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:16,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863135019] [2024-10-24 00:58:16,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:16,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:16,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:16,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:16,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:16,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:16,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:16,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:16,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:58:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:16,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:58:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:16,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:58:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:16,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:58:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:16,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:58:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:16,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:58:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:16,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 00:58:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:16,720 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:16,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:16,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863135019] [2024-10-24 00:58:16,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863135019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:16,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:16,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:58:16,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054620356] [2024-10-24 00:58:16,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:16,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:58:16,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:16,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:58:16,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:58:16,721 INFO L87 Difference]: Start difference. First operand 1019 states and 1720 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (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-10-24 00:58:17,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:17,731 INFO L93 Difference]: Finished difference Result 2564 states and 4389 transitions. [2024-10-24 00:58:17,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:58:17,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (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 115 [2024-10-24 00:58:17,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:17,739 INFO L225 Difference]: With dead ends: 2564 [2024-10-24 00:58:17,739 INFO L226 Difference]: Without dead ends: 1655 [2024-10-24 00:58:17,741 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-10-24 00:58:17,742 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 1291 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 494 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 1909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 494 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:17,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1306 Valid, 722 Invalid, 1909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [494 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:58:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2024-10-24 00:58:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1506. [2024-10-24 00:58:17,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1185 states have (on average 1.639662447257384) internal successors, (1943), 1192 states have internal predecessors, (1943), 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-10-24 00:58:17,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2560 transitions. [2024-10-24 00:58:17,790 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2560 transitions. Word has length 115 [2024-10-24 00:58:17,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:17,791 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2560 transitions. [2024-10-24 00:58:17,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (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-10-24 00:58:17,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2560 transitions. [2024-10-24 00:58:17,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 00:58:17,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:17,796 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] [2024-10-24 00:58:17,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 00:58:17,796 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:17,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:17,797 INFO L85 PathProgramCache]: Analyzing trace with hash -602067629, now seen corresponding path program 1 times [2024-10-24 00:58:17,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:17,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351610905] [2024-10-24 00:58:17,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:17,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:58:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:58:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:58:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:58:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:58:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:58:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 00:58:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,872 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:17,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:17,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351610905] [2024-10-24 00:58:17,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351610905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:17,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:17,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:58:17,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233854793] [2024-10-24 00:58:17,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:17,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:58:17,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:17,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:58:17,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:58:17,874 INFO L87 Difference]: Start difference. First operand 1506 states and 2560 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (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-10-24 00:58:18,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:18,963 INFO L93 Difference]: Finished difference Result 3666 states and 6348 transitions. [2024-10-24 00:58:18,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:58:18,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (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 116 [2024-10-24 00:58:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:18,974 INFO L225 Difference]: With dead ends: 3666 [2024-10-24 00:58:18,974 INFO L226 Difference]: Without dead ends: 2390 [2024-10-24 00:58:18,977 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-10-24 00:58:18,978 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1278 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 499 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 499 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:18,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 708 Invalid, 1894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [499 Valid, 1395 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:58:18,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2024-10-24 00:58:19,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2241. [2024-10-24 00:58:19,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2241 states, 1797 states have (on average 1.6471897607122983) internal successors, (2960), 1804 states have internal predecessors, (2960), 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-10-24 00:58:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 3839 transitions. [2024-10-24 00:58:19,043 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 3839 transitions. Word has length 116 [2024-10-24 00:58:19,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:19,043 INFO L471 AbstractCegarLoop]: Abstraction has 2241 states and 3839 transitions. [2024-10-24 00:58:19,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (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-10-24 00:58:19,044 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 3839 transitions. [2024-10-24 00:58:19,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 00:58:19,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:19,050 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] [2024-10-24 00:58:19,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 00:58:19,051 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:19,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:19,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1636442636, now seen corresponding path program 1 times [2024-10-24 00:58:19,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:19,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906544783] [2024-10-24 00:58:19,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:19,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:19,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:19,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:19,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:19,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:19,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:19,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:19,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:58:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:19,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:58:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:19,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:58:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:19,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:58:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:19,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:58:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:19,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:58:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:19,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 00:58:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:19,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:19,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906544783] [2024-10-24 00:58:19,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906544783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:19,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:19,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:58:19,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489713299] [2024-10-24 00:58:19,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:19,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:58:19,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:19,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:58:19,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:58:19,128 INFO L87 Difference]: Start difference. First operand 2241 states and 3839 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (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-10-24 00:58:20,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:20,250 INFO L93 Difference]: Finished difference Result 5376 states and 9398 transitions. [2024-10-24 00:58:20,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:58:20,251 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (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 117 [2024-10-24 00:58:20,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:20,266 INFO L225 Difference]: With dead ends: 5376 [2024-10-24 00:58:20,267 INFO L226 Difference]: Without dead ends: 3562 [2024-10-24 00:58:20,273 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-10-24 00:58:20,273 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 1278 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 501 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 501 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:20,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 714 Invalid, 1900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [501 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:58:20,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2024-10-24 00:58:20,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 3413. [2024-10-24 00:58:20,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3413 states, 2790 states have (on average 1.6523297491039426) internal successors, (4610), 2797 states have internal predecessors, (4610), 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-10-24 00:58:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3413 states to 3413 states and 5873 transitions. [2024-10-24 00:58:20,383 INFO L78 Accepts]: Start accepts. Automaton has 3413 states and 5873 transitions. Word has length 117 [2024-10-24 00:58:20,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:20,383 INFO L471 AbstractCegarLoop]: Abstraction has 3413 states and 5873 transitions. [2024-10-24 00:58:20,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (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-10-24 00:58:20,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3413 states and 5873 transitions. [2024-10-24 00:58:20,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 00:58:20,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:20,393 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] [2024-10-24 00:58:20,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 00:58:20,393 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:20,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:20,394 INFO L85 PathProgramCache]: Analyzing trace with hash 27549655, now seen corresponding path program 1 times [2024-10-24 00:58:20,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:20,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80644824] [2024-10-24 00:58:20,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:20,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:58:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:58:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:58:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:58:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:58:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 00:58:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 00:58:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,501 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:20,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:20,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80644824] [2024-10-24 00:58:20,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80644824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:20,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:20,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:58:20,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596472574] [2024-10-24 00:58:20,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:20,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:58:20,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:20,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:58:20,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:58:20,502 INFO L87 Difference]: Start difference. First operand 3413 states and 5873 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (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-10-24 00:58:21,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:21,604 INFO L93 Difference]: Finished difference Result 8231 states and 14452 transitions. [2024-10-24 00:58:21,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:58:21,604 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (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 118 [2024-10-24 00:58:21,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:21,650 INFO L225 Difference]: With dead ends: 8231 [2024-10-24 00:58:21,650 INFO L226 Difference]: Without dead ends: 5532 [2024-10-24 00:58:21,656 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-10-24 00:58:21,656 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 1262 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 488 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:21,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 730 Invalid, 1928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [488 Valid, 1440 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:58:21,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5532 states. [2024-10-24 00:58:21,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5532 to 5383. [2024-10-24 00:58:21,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5383 states, 4384 states have (on average 1.6425638686131387) internal successors, (7201), 4391 states have internal predecessors, (7201), 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-10-24 00:58:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5383 states to 5383 states and 9260 transitions. [2024-10-24 00:58:21,819 INFO L78 Accepts]: Start accepts. Automaton has 5383 states and 9260 transitions. Word has length 118 [2024-10-24 00:58:21,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:21,819 INFO L471 AbstractCegarLoop]: Abstraction has 5383 states and 9260 transitions. [2024-10-24 00:58:21,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (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-10-24 00:58:21,820 INFO L276 IsEmpty]: Start isEmpty. Operand 5383 states and 9260 transitions. [2024-10-24 00:58:21,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 00:58:21,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:21,838 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] [2024-10-24 00:58:21,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 00:58:21,838 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:21,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:21,838 INFO L85 PathProgramCache]: Analyzing trace with hash -641360016, now seen corresponding path program 1 times [2024-10-24 00:58:21,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:21,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92958377] [2024-10-24 00:58:21,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:21,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:21,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:21,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:21,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:21,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:21,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:21,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:21,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:58:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:21,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:58:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:21,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:58:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:21,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:58:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:21,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:58:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:21,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 00:58:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:21,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 00:58:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:21,922 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:21,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:21,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92958377] [2024-10-24 00:58:21,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92958377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:21,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:21,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:58:21,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107855664] [2024-10-24 00:58:21,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:21,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:58:21,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:21,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:58:21,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:58:21,924 INFO L87 Difference]: Start difference. First operand 5383 states and 9260 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (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-10-24 00:58:23,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:23,111 INFO L93 Difference]: Finished difference Result 13368 states and 23473 transitions. [2024-10-24 00:58:23,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:58:23,111 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (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 119 [2024-10-24 00:58:23,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:23,146 INFO L225 Difference]: With dead ends: 13368 [2024-10-24 00:58:23,146 INFO L226 Difference]: Without dead ends: 9065 [2024-10-24 00:58:23,159 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-10-24 00:58:23,159 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 1260 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 504 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 504 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:23,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 728 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [504 Valid, 1452 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:58:23,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9065 states. [2024-10-24 00:58:23,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9065 to 8916. [2024-10-24 00:58:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8916 states, 7311 states have (on average 1.640951990151826) internal successors, (11997), 7318 states have internal predecessors, (11997), 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-10-24 00:58:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8916 states to 8916 states and 15346 transitions. [2024-10-24 00:58:23,437 INFO L78 Accepts]: Start accepts. Automaton has 8916 states and 15346 transitions. Word has length 119 [2024-10-24 00:58:23,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:23,437 INFO L471 AbstractCegarLoop]: Abstraction has 8916 states and 15346 transitions. [2024-10-24 00:58:23,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (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-10-24 00:58:23,438 INFO L276 IsEmpty]: Start isEmpty. Operand 8916 states and 15346 transitions. [2024-10-24 00:58:23,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 00:58:23,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:23,454 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] [2024-10-24 00:58:23,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 00:58:23,455 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:23,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:23,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2016217623, now seen corresponding path program 1 times [2024-10-24 00:58:23,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:23,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743238971] [2024-10-24 00:58:23,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:23,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:23,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:23,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:23,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:23,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:23,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:23,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:23,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:58:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:23,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:58:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:23,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:58:23,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:23,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:58:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:23,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:58:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:23,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 00:58:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:23,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 00:58:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:23,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:23,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743238971] [2024-10-24 00:58:23,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743238971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:23,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:23,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:58:23,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224194305] [2024-10-24 00:58:23,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:23,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:58:23,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:23,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:58:23,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:58:23,531 INFO L87 Difference]: Start difference. First operand 8916 states and 15346 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (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-10-24 00:58:24,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:24,777 INFO L93 Difference]: Finished difference Result 23140 states and 40607 transitions. [2024-10-24 00:58:24,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:58:24,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (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 120 [2024-10-24 00:58:24,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:24,820 INFO L225 Difference]: With dead ends: 23140 [2024-10-24 00:58:24,820 INFO L226 Difference]: Without dead ends: 15737 [2024-10-24 00:58:24,835 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-10-24 00:58:24,836 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 1257 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 1948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:24,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 735 Invalid, 1948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:58:24,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15737 states. [2024-10-24 00:58:25,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15737 to 15588. [2024-10-24 00:58:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15588 states, 12780 states have (on average 1.6320813771517997) internal successors, (20858), 12787 states have internal predecessors, (20858), 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-10-24 00:58:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15588 states to 15588 states and 26757 transitions. [2024-10-24 00:58:25,367 INFO L78 Accepts]: Start accepts. Automaton has 15588 states and 26757 transitions. Word has length 120 [2024-10-24 00:58:25,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:25,367 INFO L471 AbstractCegarLoop]: Abstraction has 15588 states and 26757 transitions. [2024-10-24 00:58:25,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (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-10-24 00:58:25,367 INFO L276 IsEmpty]: Start isEmpty. Operand 15588 states and 26757 transitions. [2024-10-24 00:58:25,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 00:58:25,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:25,391 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] [2024-10-24 00:58:25,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 00:58:25,392 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:25,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:25,392 INFO L85 PathProgramCache]: Analyzing trace with hash 21707727, now seen corresponding path program 1 times [2024-10-24 00:58:25,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:25,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465937008] [2024-10-24 00:58:25,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:25,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:58:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:58:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:58:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:58:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:58:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 00:58:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 00:58:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:25,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:25,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465937008] [2024-10-24 00:58:25,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465937008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:25,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:25,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:58:25,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82055901] [2024-10-24 00:58:25,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:25,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:58:25,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:25,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:58:25,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:58:25,462 INFO L87 Difference]: Start difference. First operand 15588 states and 26757 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (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-10-24 00:58:27,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:27,006 INFO L93 Difference]: Finished difference Result 41307 states and 72407 transitions. [2024-10-24 00:58:27,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:58:27,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (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 121 [2024-10-24 00:58:27,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:27,094 INFO L225 Difference]: With dead ends: 41307 [2024-10-24 00:58:27,094 INFO L226 Difference]: Without dead ends: 27852 [2024-10-24 00:58:27,123 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-10-24 00:58:27,124 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1305 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1320 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:27,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1320 Valid, 709 Invalid, 1864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:58:27,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27852 states. [2024-10-24 00:58:27,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27852 to 27703. [2024-10-24 00:58:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27703 states, 22856 states have (on average 1.6285439271963598) internal successors, (37222), 22863 states have internal predecessors, (37222), 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-10-24 00:58:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27703 states to 27703 states and 47473 transitions. [2024-10-24 00:58:28,069 INFO L78 Accepts]: Start accepts. Automaton has 27703 states and 47473 transitions. Word has length 121 [2024-10-24 00:58:28,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:28,069 INFO L471 AbstractCegarLoop]: Abstraction has 27703 states and 47473 transitions. [2024-10-24 00:58:28,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (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-10-24 00:58:28,070 INFO L276 IsEmpty]: Start isEmpty. Operand 27703 states and 47473 transitions. [2024-10-24 00:58:28,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 00:58:28,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:28,096 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] [2024-10-24 00:58:28,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 00:58:28,096 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:28,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:28,097 INFO L85 PathProgramCache]: Analyzing trace with hash -2105417721, now seen corresponding path program 1 times [2024-10-24 00:58:28,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:28,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354134716] [2024-10-24 00:58:28,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:28,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:28,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:28,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:28,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:28,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:28,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:28,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:28,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:58:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:28,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:58:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:28,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:58:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:28,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:58:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:28,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:58:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:28,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 00:58:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:28,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 00:58:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:28,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:28,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354134716] [2024-10-24 00:58:28,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354134716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:28,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:28,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:58:28,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051324704] [2024-10-24 00:58:28,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:28,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:58:28,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:28,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:58:28,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:58:28,191 INFO L87 Difference]: Start difference. First operand 27703 states and 47473 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (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-10-24 00:58:30,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:30,345 INFO L93 Difference]: Finished difference Result 75499 states and 131596 transitions. [2024-10-24 00:58:30,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:58:30,345 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (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 122 [2024-10-24 00:58:30,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:30,517 INFO L225 Difference]: With dead ends: 75499 [2024-10-24 00:58:30,517 INFO L226 Difference]: Without dead ends: 50676 [2024-10-24 00:58:30,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-10-24 00:58:30,587 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1239 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:30,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 720 Invalid, 1939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [493 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:58:30,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50676 states. [2024-10-24 00:58:32,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50676 to 50527. [2024-10-24 00:58:32,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50527 states, 41965 states have (on average 1.6236387465745263) internal successors, (68136), 41972 states have internal predecessors, (68136), 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-10-24 00:58:32,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50527 states to 50527 states and 86349 transitions. [2024-10-24 00:58:32,584 INFO L78 Accepts]: Start accepts. Automaton has 50527 states and 86349 transitions. Word has length 122 [2024-10-24 00:58:32,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:32,585 INFO L471 AbstractCegarLoop]: Abstraction has 50527 states and 86349 transitions. [2024-10-24 00:58:32,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (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-10-24 00:58:32,585 INFO L276 IsEmpty]: Start isEmpty. Operand 50527 states and 86349 transitions. [2024-10-24 00:58:32,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-24 00:58:32,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:32,613 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] [2024-10-24 00:58:32,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 00:58:32,614 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:32,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:32,614 INFO L85 PathProgramCache]: Analyzing trace with hash 846661743, now seen corresponding path program 1 times [2024-10-24 00:58:32,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:32,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938614298] [2024-10-24 00:58:32,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:32,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:32,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:32,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:32,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:32,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:32,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:32,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:32,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:32,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:58:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:32,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:58:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:32,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:58:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:32,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:58:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:32,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:58:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:32,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 00:58:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:32,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 00:58:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:32,695 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:32,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:32,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938614298] [2024-10-24 00:58:32,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938614298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:32,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:32,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:58:32,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275331983] [2024-10-24 00:58:32,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:32,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:58:32,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:32,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:58:32,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:58:32,697 INFO L87 Difference]: Start difference. First operand 50527 states and 86349 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 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-10-24 00:58:35,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:35,527 INFO L93 Difference]: Finished difference Result 94246 states and 164759 transitions. [2024-10-24 00:58:35,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:58:35,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 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 123 [2024-10-24 00:58:35,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:35,800 INFO L225 Difference]: With dead ends: 94246 [2024-10-24 00:58:35,801 INFO L226 Difference]: Without dead ends: 94056 [2024-10-24 00:58:35,833 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-10-24 00:58:35,833 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1205 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 484 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:35,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 718 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [484 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:58:35,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94056 states. [2024-10-24 00:58:38,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94056 to 93907. [2024-10-24 00:58:38,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93907 states, 78546 states have (on average 1.6172306673796246) internal successors, (127027), 78553 states have internal predecessors, (127027), 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-10-24 00:58:38,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93907 states to 93907 states and 159884 transitions. [2024-10-24 00:58:38,962 INFO L78 Accepts]: Start accepts. Automaton has 93907 states and 159884 transitions. Word has length 123 [2024-10-24 00:58:38,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:38,962 INFO L471 AbstractCegarLoop]: Abstraction has 93907 states and 159884 transitions. [2024-10-24 00:58:38,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 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-10-24 00:58:38,962 INFO L276 IsEmpty]: Start isEmpty. Operand 93907 states and 159884 transitions. [2024-10-24 00:58:38,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 00:58:38,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:38,994 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] [2024-10-24 00:58:38,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 00:58:38,994 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:38,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:38,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1565114328, now seen corresponding path program 1 times [2024-10-24 00:58:38,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:38,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181166888] [2024-10-24 00:58:38,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:38,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:39,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:39,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:39,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:39,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:39,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:39,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:39,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:58:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:39,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:58:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:39,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:58:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:39,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:58:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:39,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:58:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:39,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 00:58:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:39,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 00:58:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:39,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:39,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181166888] [2024-10-24 00:58:39,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181166888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:39,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:39,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-24 00:58:39,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630479778] [2024-10-24 00:58:39,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:39,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 00:58:39,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:39,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 00:58:39,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2024-10-24 00:58:39,348 INFO L87 Difference]: Start difference. First operand 93907 states and 159884 transitions. Second operand has 18 states, 16 states have (on average 5.1875) internal successors, (83), 12 states have internal predecessors, (83), 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-10-24 00:58:48,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:48,070 INFO L93 Difference]: Finished difference Result 187933 states and 331875 transitions. [2024-10-24 00:58:48,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-24 00:58:48,071 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.1875) internal successors, (83), 12 states have internal predecessors, (83), 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 124 [2024-10-24 00:58:48,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:48,961 INFO L225 Difference]: With dead ends: 187933 [2024-10-24 00:58:48,961 INFO L226 Difference]: Without dead ends: 187748 [2024-10-24 00:58:49,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=863, Invalid=3967, Unknown=0, NotChecked=0, Total=4830 [2024-10-24 00:58:49,020 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 4539 mSDsluCounter, 2156 mSDsCounter, 0 mSdLazyCounter, 8213 mSolverCounterSat, 1789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4551 SdHoareTripleChecker+Valid, 2370 SdHoareTripleChecker+Invalid, 10002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1789 IncrementalHoareTripleChecker+Valid, 8213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:49,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4551 Valid, 2370 Invalid, 10002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1789 Valid, 8213 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-24 00:58:49,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187748 states. [2024-10-24 00:58:55,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187748 to 187076. [2024-10-24 00:58:55,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187076 states, 156528 states have (on average 1.6180427782888684) internal successors, (253269), 156433 states have internal predecessors, (253269), 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-10-24 00:58:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187076 states to 187076 states and 321880 transitions. [2024-10-24 00:58:55,972 INFO L78 Accepts]: Start accepts. Automaton has 187076 states and 321880 transitions. Word has length 124 [2024-10-24 00:58:55,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:55,972 INFO L471 AbstractCegarLoop]: Abstraction has 187076 states and 321880 transitions. [2024-10-24 00:58:55,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.1875) internal successors, (83), 12 states have internal predecessors, (83), 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-10-24 00:58:55,972 INFO L276 IsEmpty]: Start isEmpty. Operand 187076 states and 321880 transitions. [2024-10-24 00:58:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 00:58:56,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:56,053 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] [2024-10-24 00:58:56,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 00:58:56,054 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:56,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:56,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1774652705, now seen corresponding path program 1 times [2024-10-24 00:58:56,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:56,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046048477] [2024-10-24 00:58:56,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:56,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:56,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:56,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:56,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:56,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:56,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:56,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:56,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:58:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:56,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:58:56,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:56,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:58:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:56,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:58:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:56,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:58:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:56,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 00:58:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:56,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 00:58:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:56,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:56,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046048477] [2024-10-24 00:58:56,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046048477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:56,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:56,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 00:58:56,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692842482] [2024-10-24 00:58:56,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:56,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 00:58:56,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:56,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 00:58:56,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:58:56,816 INFO L87 Difference]: Start difference. First operand 187076 states and 321880 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 8 states have internal predecessors, (84), 5 states have call successors, (15), 7 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-24 00:59:03,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:59:03,140 INFO L93 Difference]: Finished difference Result 188704 states and 330896 transitions. [2024-10-24 00:59:03,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-24 00:59:03,142 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 8 states have internal predecessors, (84), 5 states have call successors, (15), 7 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 125 [2024-10-24 00:59:03,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:59:03,805 INFO L225 Difference]: With dead ends: 188704 [2024-10-24 00:59:03,806 INFO L226 Difference]: Without dead ends: 187580 [2024-10-24 00:59:03,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2024-10-24 00:59:03,873 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 2249 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 4579 mSolverCounterSat, 905 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2264 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 5484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 905 IncrementalHoareTripleChecker+Valid, 4579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:59:03,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2264 Valid, 1424 Invalid, 5484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [905 Valid, 4579 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 00:59:03,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187580 states.