./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_spec7_product13.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_spec7_product13.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 2fde44ff6f2aac911c03318478d3361889c0f9ce519411733d9129672caa5fa0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 00:53:31,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 00:53:31,679 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 00:53:31,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 00:53:31,688 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 00:53:31,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 00:53:31,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 00:53:31,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 00:53:31,719 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 00:53:31,720 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 00:53:31,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 00:53:31,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 00:53:31,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 00:53:31,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 00:53:31,724 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 00:53:31,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 00:53:31,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 00:53:31,725 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 00:53:31,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 00:53:31,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 00:53:31,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 00:53:31,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 00:53:31,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 00:53:31,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 00:53:31,731 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 00:53:31,731 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 00:53:31,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 00:53:31,731 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 00:53:31,732 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 00:53:31,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 00:53:31,732 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 00:53:31,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 00:53:31,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:53:31,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 00:53:31,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 00:53:31,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 00:53:31,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 00:53:31,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 00:53:31,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 00:53:31,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 00:53:31,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 00:53:31,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 00:53:31,737 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 -> 2fde44ff6f2aac911c03318478d3361889c0f9ce519411733d9129672caa5fa0 [2024-10-24 00:53:32,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 00:53:32,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 00:53:32,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 00:53:32,044 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 00:53:32,045 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 00:53:32,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product13.cil.c [2024-10-24 00:53:33,491 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 00:53:33,801 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 00:53:33,802 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product13.cil.c [2024-10-24 00:53:33,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbb5f9472/9ff96b0ed25048d8ba547ebbacb2ce37/FLAG5689ba47a [2024-10-24 00:53:34,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbb5f9472/9ff96b0ed25048d8ba547ebbacb2ce37 [2024-10-24 00:53:34,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 00:53:34,077 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 00:53:34,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 00:53:34,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 00:53:34,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 00:53:34,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:53:34" (1/1) ... [2024-10-24 00:53:34,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64dcb283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:34, skipping insertion in model container [2024-10-24 00:53:34,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:53:34" (1/1) ... [2024-10-24 00:53:34,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 00:53:34,504 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_spec7_product13.cil.c[16810,16823] [2024-10-24 00:53:34,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:53:34,690 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 00:53:34,700 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptVerify_spec.i","") [48] [2024-10-24 00:53:34,701 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [79] [2024-10-24 00:53:34,702 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [371] [2024-10-24 00:53:34,702 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [737] [2024-10-24 00:53:34,703 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [746] [2024-10-24 00:53:34,703 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [781] [2024-10-24 00:53:34,703 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1193] [2024-10-24 00:53:34,703 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1210] [2024-10-24 00:53:34,703 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1308] [2024-10-24 00:53:34,704 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1562] [2024-10-24 00:53:34,704 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2631] [2024-10-24 00:53:34,730 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_spec7_product13.cil.c[16810,16823] [2024-10-24 00:53:34,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:53:34,868 INFO L204 MainTranslator]: Completed translation [2024-10-24 00:53:34,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:34 WrapperNode [2024-10-24 00:53:34,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 00:53:34,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 00:53:34,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 00:53:34,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 00:53:34,876 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:53:34" (1/1) ... [2024-10-24 00:53:34,914 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:53:34" (1/1) ... [2024-10-24 00:53:34,963 INFO L138 Inliner]: procedures = 124, calls = 176, calls flagged for inlining = 54, calls inlined = 45, statements flattened = 851 [2024-10-24 00:53:34,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 00:53:34,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 00:53:34,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 00:53:34,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 00:53:34,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:34" (1/1) ... [2024-10-24 00:53:34,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:34" (1/1) ... [2024-10-24 00:53:34,986 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:34" (1/1) ... [2024-10-24 00:53:35,025 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:53:35,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:34" (1/1) ... [2024-10-24 00:53:35,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:34" (1/1) ... [2024-10-24 00:53:35,045 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:34" (1/1) ... [2024-10-24 00:53:35,061 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:34" (1/1) ... [2024-10-24 00:53:35,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:34" (1/1) ... [2024-10-24 00:53:35,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:34" (1/1) ... [2024-10-24 00:53:35,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 00:53:35,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 00:53:35,081 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 00:53:35,081 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 00:53:35,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:34" (1/1) ... [2024-10-24 00:53:35,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:53:35,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:53:35,128 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:53:35,131 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:53:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-24 00:53:35,179 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-24 00:53:35,179 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-24 00:53:35,179 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-24 00:53:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-24 00:53:35,180 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-24 00:53:35,180 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-24 00:53:35,180 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-24 00:53:35,182 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-24 00:53:35,182 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-24 00:53:35,182 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-24 00:53:35,183 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-24 00:53:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-24 00:53:35,183 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-24 00:53:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-24 00:53:35,184 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-24 00:53:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 00:53:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-24 00:53:35,186 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-24 00:53:35,186 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-24 00:53:35,187 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-24 00:53:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-24 00:53:35,187 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-24 00:53:35,187 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-24 00:53:35,187 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-24 00:53:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-24 00:53:35,188 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-24 00:53:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-24 00:53:35,188 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-24 00:53:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 00:53:35,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 00:53:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 00:53:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 00:53:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-24 00:53:35,189 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-24 00:53:35,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 00:53:35,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 00:53:35,390 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 00:53:35,393 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 00:53:36,090 INFO L? ?]: Removed 362 outVars from TransFormulas that were not future-live. [2024-10-24 00:53:36,091 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 00:53:36,151 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 00:53:36,151 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 00:53:36,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:53:36 BoogieIcfgContainer [2024-10-24 00:53:36,152 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 00:53:36,157 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 00:53:36,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 00:53:36,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 00:53:36,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:53:34" (1/3) ... [2024-10-24 00:53:36,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e9eedd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:53:36, skipping insertion in model container [2024-10-24 00:53:36,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:53:34" (2/3) ... [2024-10-24 00:53:36,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e9eedd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:53:36, skipping insertion in model container [2024-10-24 00:53:36,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:53:36" (3/3) ... [2024-10-24 00:53:36,164 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec7_product13.cil.c [2024-10-24 00:53:36,176 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 00:53:36,176 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 00:53:36,243 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 00:53:36,252 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;@41347e44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 00:53:36,252 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 00:53:36,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 242 states, 190 states have (on average 1.6210526315789473) internal successors, (308), 192 states have internal predecessors, (308), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-24 00:53:36,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 00:53:36,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:53:36,278 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] [2024-10-24 00:53:36,279 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:53:36,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:53:36,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2058146720, now seen corresponding path program 1 times [2024-10-24 00:53:36,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:53:36,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301531627] [2024-10-24 00:53:36,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:36,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:53:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:36,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:53:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:36,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:53:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:36,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:53:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:37,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:53:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:37,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:53:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:37,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:53:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:37,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 00:53:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:37,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 00:53:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:37,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:53:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:37,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:53:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:37,071 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:53:37,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:53:37,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301531627] [2024-10-24 00:53:37,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301531627] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:53:37,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107760142] [2024-10-24 00:53:37,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:37,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:53:37,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:53:37,076 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:53:37,077 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:53:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:37,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 00:53:37,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:53:37,425 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:53:37,425 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:53:37,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107760142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:53:37,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:53:37,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-10-24 00:53:37,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179859192] [2024-10-24 00:53:37,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:53:37,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 00:53:37,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:53:37,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 00:53:37,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 00:53:37,468 INFO L87 Difference]: Start difference. First operand has 242 states, 190 states have (on average 1.6210526315789473) internal successors, (308), 192 states have internal predecessors, (308), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:53:37,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:53:37,563 INFO L93 Difference]: Finished difference Result 343 states and 526 transitions. [2024-10-24 00:53:37,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 00:53:37,568 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 76 [2024-10-24 00:53:37,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:53:37,584 INFO L225 Difference]: With dead ends: 343 [2024-10-24 00:53:37,585 INFO L226 Difference]: Without dead ends: 239 [2024-10-24 00:53:37,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 00:53:37,595 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:53:37,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 364 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:53:37,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-24 00:53:37,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2024-10-24 00:53:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 188 states have (on average 1.601063829787234) internal successors, (301), 189 states have internal predecessors, (301), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 00:53:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 370 transitions. [2024-10-24 00:53:37,659 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 370 transitions. Word has length 76 [2024-10-24 00:53:37,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:53:37,661 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 370 transitions. [2024-10-24 00:53:37,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:53:37,662 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 370 transitions. [2024-10-24 00:53:37,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 00:53:37,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:53:37,667 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] [2024-10-24 00:53:37,686 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:53:37,868 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:53:37,868 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:53:37,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:53:37,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1362980545, now seen corresponding path program 1 times [2024-10-24 00:53:37,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:53:37,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841997510] [2024-10-24 00:53:37,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:37,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:53:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:38,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:53:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:38,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:53:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:38,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:53:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:38,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:53:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:38,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:53:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:38,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:53:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:38,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:53:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:38,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 00:53:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:38,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:53:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:38,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:53:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:38,157 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:53:38,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:53:38,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841997510] [2024-10-24 00:53:38,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841997510] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:53:38,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094242411] [2024-10-24 00:53:38,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:38,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:53:38,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:53:38,180 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:53:38,182 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:53:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:38,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 00:53:38,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:53:38,473 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:53:38,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:53:38,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094242411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:53:38,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:53:38,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-24 00:53:38,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465435952] [2024-10-24 00:53:38,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:53:38,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:53:38,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:53:38,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:53:38,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:53:38,480 INFO L87 Difference]: Start difference. First operand 239 states and 370 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:53:38,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:53:38,552 INFO L93 Difference]: Finished difference Result 339 states and 513 transitions. [2024-10-24 00:53:38,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:53:38,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 77 [2024-10-24 00:53:38,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:53:38,555 INFO L225 Difference]: With dead ends: 339 [2024-10-24 00:53:38,555 INFO L226 Difference]: Without dead ends: 241 [2024-10-24 00:53:38,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 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:53:38,558 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 0 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 721 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:53:38,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 721 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:53:38,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-24 00:53:38,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2024-10-24 00:53:38,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 190 states have (on average 1.5947368421052632) internal successors, (303), 191 states have internal predecessors, (303), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 00:53:38,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 372 transitions. [2024-10-24 00:53:38,585 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 372 transitions. Word has length 77 [2024-10-24 00:53:38,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:53:38,586 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 372 transitions. [2024-10-24 00:53:38,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:53:38,588 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 372 transitions. [2024-10-24 00:53:38,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 00:53:38,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:53:38,593 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] [2024-10-24 00:53:38,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 00:53:38,793 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:53:38,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:53:38,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:53:38,794 INFO L85 PathProgramCache]: Analyzing trace with hash -2057876358, now seen corresponding path program 1 times [2024-10-24 00:53:38,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:53:38,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466907163] [2024-10-24 00:53:38,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:38,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:53:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:38,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:53:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:39,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:53:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:39,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:53:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:39,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:53:39,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:39,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:53:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:39,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:53:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:39,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 00:53:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:39,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:53:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:39,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:53:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:39,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:53:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:39,070 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:53:39,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:53:39,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466907163] [2024-10-24 00:53:39,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466907163] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:53:39,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932186103] [2024-10-24 00:53:39,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:39,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:53:39,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:53:39,074 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:53:39,076 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:53:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:39,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:53:39,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:53:39,358 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:53:39,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:53:39,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932186103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:53:39,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:53:39,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-24 00:53:39,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59503404] [2024-10-24 00:53:39,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:53:39,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:53:39,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:53:39,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:53:39,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:53:39,361 INFO L87 Difference]: Start difference. First operand 241 states and 372 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:53:39,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:53:39,401 INFO L93 Difference]: Finished difference Result 508 states and 796 transitions. [2024-10-24 00:53:39,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:53:39,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 82 [2024-10-24 00:53:39,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:53:39,404 INFO L225 Difference]: With dead ends: 508 [2024-10-24 00:53:39,405 INFO L226 Difference]: Without dead ends: 289 [2024-10-24 00:53:39,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:53:39,410 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 95 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:53:39,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 691 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:53:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-24 00:53:39,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 284. [2024-10-24 00:53:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 222 states have (on average 1.6036036036036037) internal successors, (356), 223 states have internal predecessors, (356), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 00:53:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 447 transitions. [2024-10-24 00:53:39,454 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 447 transitions. Word has length 82 [2024-10-24 00:53:39,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:53:39,455 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 447 transitions. [2024-10-24 00:53:39,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:53:39,455 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 447 transitions. [2024-10-24 00:53:39,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 00:53:39,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:53:39,458 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] [2024-10-24 00:53:39,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 00:53:39,659 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:53:39,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:53:39,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:53:39,660 INFO L85 PathProgramCache]: Analyzing trace with hash -904675323, now seen corresponding path program 1 times [2024-10-24 00:53:39,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:53:39,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737774859] [2024-10-24 00:53:39,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:39,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:53:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:39,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:53:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:39,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:53:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:39,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:53:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:39,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:53:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:39,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:53:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:39,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:53:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:39,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 00:53:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:39,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:53:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:39,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:53:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:39,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:53:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:39,857 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:53:39,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:53:39,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737774859] [2024-10-24 00:53:39,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737774859] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:53:39,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048945156] [2024-10-24 00:53:39,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:39,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:53:39,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:53:39,860 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:53:39,862 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:53:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:40,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 00:53:40,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:53:40,176 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:53:40,176 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:53:40,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048945156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:53:40,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:53:40,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-10-24 00:53:40,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659351737] [2024-10-24 00:53:40,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:53:40,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:53:40,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:53:40,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:53:40,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:53:40,179 INFO L87 Difference]: Start difference. First operand 284 states and 447 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 00:53:40,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:53:40,259 INFO L93 Difference]: Finished difference Result 563 states and 888 transitions. [2024-10-24 00:53:40,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:53:40,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 83 [2024-10-24 00:53:40,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:53:40,264 INFO L225 Difference]: With dead ends: 563 [2024-10-24 00:53:40,264 INFO L226 Difference]: Without dead ends: 286 [2024-10-24 00:53:40,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:53:40,266 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 2 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:53:40,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1401 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:53:40,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-24 00:53:40,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2024-10-24 00:53:40,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 223 states have (on average 1.600896860986547) internal successors, (357), 225 states have internal predecessors, (357), 46 states have call successors, (46), 15 states have call predecessors, (46), 16 states have return successors, (47), 45 states have call predecessors, (47), 45 states have call successors, (47) [2024-10-24 00:53:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 450 transitions. [2024-10-24 00:53:40,287 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 450 transitions. Word has length 83 [2024-10-24 00:53:40,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:53:40,287 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 450 transitions. [2024-10-24 00:53:40,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 00:53:40,288 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 450 transitions. [2024-10-24 00:53:40,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 00:53:40,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:53:40,289 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] [2024-10-24 00:53:40,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 00:53:40,490 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:53:40,490 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:53:40,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:53:40,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1546862210, now seen corresponding path program 1 times [2024-10-24 00:53:40,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:53:40,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830792722] [2024-10-24 00:53:40,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:40,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:53:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:40,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:53:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:40,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:53:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:40,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:53:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:40,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:53:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:40,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 00:53:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:40,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 00:53:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:40,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 00:53:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:40,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:53:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:40,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:53:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:40,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:53:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:40,719 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:53:40,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:53:40,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830792722] [2024-10-24 00:53:40,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830792722] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:53:40,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984728735] [2024-10-24 00:53:40,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:40,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:53:40,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:53:40,725 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:53:40,728 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:53:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:40,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 00:53:40,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:53:41,035 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:53:41,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:53:41,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984728735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:53:41,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:53:41,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-10-24 00:53:41,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698264187] [2024-10-24 00:53:41,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:53:41,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:53:41,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:53:41,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:53:41,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:53:41,039 INFO L87 Difference]: Start difference. First operand 286 states and 450 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 00:53:41,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:53:41,125 INFO L93 Difference]: Finished difference Result 565 states and 893 transitions. [2024-10-24 00:53:41,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:53:41,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 84 [2024-10-24 00:53:41,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:53:41,129 INFO L225 Difference]: With dead ends: 565 [2024-10-24 00:53:41,129 INFO L226 Difference]: Without dead ends: 288 [2024-10-24 00:53:41,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:53:41,132 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 2 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:53:41,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1387 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:53:41,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-24 00:53:41,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-10-24 00:53:41,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 224 states have (on average 1.5982142857142858) internal successors, (358), 227 states have internal predecessors, (358), 46 states have call successors, (46), 15 states have call predecessors, (46), 17 states have return successors, (52), 45 states have call predecessors, (52), 45 states have call successors, (52) [2024-10-24 00:53:41,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 456 transitions. [2024-10-24 00:53:41,144 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 456 transitions. Word has length 84 [2024-10-24 00:53:41,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:53:41,145 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 456 transitions. [2024-10-24 00:53:41,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 00:53:41,145 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 456 transitions. [2024-10-24 00:53:41,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 00:53:41,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:53:41,147 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] [2024-10-24 00:53:41,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 00:53:41,347 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:53:41,348 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:53:41,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:53:41,348 INFO L85 PathProgramCache]: Analyzing trace with hash 200934642, now seen corresponding path program 1 times [2024-10-24 00:53:41,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:53:41,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925196279] [2024-10-24 00:53:41,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:41,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:53:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:41,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:53:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:41,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:53:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:41,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:53:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:41,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:53:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:41,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:53:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:41,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 00:53:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:41,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 00:53:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:41,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:53:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:41,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:53:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:41,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:53:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:41,516 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:53:41,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:53:41,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925196279] [2024-10-24 00:53:41,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925196279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:53:41,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:53:41,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 00:53:41,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718597707] [2024-10-24 00:53:41,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:53:41,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 00:53:41,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:53:41,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 00:53:41,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 00:53:41,518 INFO L87 Difference]: Start difference. First operand 288 states and 456 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 00:53:42,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:53:42,759 INFO L93 Difference]: Finished difference Result 611 states and 976 transitions. [2024-10-24 00:53:42,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:53:42,761 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 85 [2024-10-24 00:53:42,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:53:42,764 INFO L225 Difference]: With dead ends: 611 [2024-10-24 00:53:42,765 INFO L226 Difference]: Without dead ends: 342 [2024-10-24 00:53:42,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:53:42,769 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 578 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:53:42,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 817 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 00:53:42,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-24 00:53:42,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 288. [2024-10-24 00:53:42,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 224 states have (on average 1.5982142857142858) internal successors, (358), 227 states have internal predecessors, (358), 46 states have call successors, (46), 15 states have call predecessors, (46), 17 states have return successors, (51), 45 states have call predecessors, (51), 45 states have call successors, (51) [2024-10-24 00:53:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 455 transitions. [2024-10-24 00:53:42,799 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 455 transitions. Word has length 85 [2024-10-24 00:53:42,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:53:42,800 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 455 transitions. [2024-10-24 00:53:42,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 00:53:42,800 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 455 transitions. [2024-10-24 00:53:42,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 00:53:42,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:53:42,802 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] [2024-10-24 00:53:42,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 00:53:42,803 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:53:42,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:53:42,803 INFO L85 PathProgramCache]: Analyzing trace with hash 562323533, now seen corresponding path program 2 times [2024-10-24 00:53:42,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:53:42,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542887737] [2024-10-24 00:53:42,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:42,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:53:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:42,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:53:42,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:42,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:53:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:42,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:53:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:42,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:53:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:42,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:53:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:42,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 00:53:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:42,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 00:53:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:42,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:53:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:42,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:53:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:42,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:53:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:42,960 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:53:42,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:53:42,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542887737] [2024-10-24 00:53:42,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542887737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:53:42,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:53:42,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 00:53:42,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827126868] [2024-10-24 00:53:42,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:53:42,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 00:53:42,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:53:42,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 00:53:42,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 00:53:42,962 INFO L87 Difference]: Start difference. First operand 288 states and 455 transitions. Second operand has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 00:53:44,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:53:44,053 INFO L93 Difference]: Finished difference Result 613 states and 979 transitions. [2024-10-24 00:53:44,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:53:44,054 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 86 [2024-10-24 00:53:44,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:53:44,058 INFO L225 Difference]: With dead ends: 613 [2024-10-24 00:53:44,059 INFO L226 Difference]: Without dead ends: 344 [2024-10-24 00:53:44,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:53:44,061 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 575 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:53:44,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 816 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:53:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-24 00:53:44,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 290. [2024-10-24 00:53:44,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 225 states have (on average 1.5955555555555556) internal successors, (359), 229 states have internal predecessors, (359), 46 states have call successors, (46), 15 states have call predecessors, (46), 18 states have return successors, (53), 45 states have call predecessors, (53), 45 states have call successors, (53) [2024-10-24 00:53:44,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 458 transitions. [2024-10-24 00:53:44,087 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 458 transitions. Word has length 86 [2024-10-24 00:53:44,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:53:44,089 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 458 transitions. [2024-10-24 00:53:44,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 00:53:44,089 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 458 transitions. [2024-10-24 00:53:44,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 00:53:44,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:53:44,090 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] [2024-10-24 00:53:44,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 00:53:44,091 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:53:44,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:53:44,091 INFO L85 PathProgramCache]: Analyzing trace with hash -560741095, now seen corresponding path program 1 times [2024-10-24 00:53:44,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:53:44,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073316005] [2024-10-24 00:53:44,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:44,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:53:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:44,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:53:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:44,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:53:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:44,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:53:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:44,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:53:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:44,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:53:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:44,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:53:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:44,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:53:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:44,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:53:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:44,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:53:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:44,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:53:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:53:44,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:53:44,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073316005] [2024-10-24 00:53:44,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073316005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:53:44,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:53:44,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 00:53:44,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454453653] [2024-10-24 00:53:44,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:53:44,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 00:53:44,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:53:44,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 00:53:44,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 00:53:44,252 INFO L87 Difference]: Start difference. First operand 290 states and 458 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 00:53:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:53:45,360 INFO L93 Difference]: Finished difference Result 613 states and 978 transitions. [2024-10-24 00:53:45,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 00:53:45,360 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2024-10-24 00:53:45,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:53:45,363 INFO L225 Difference]: With dead ends: 613 [2024-10-24 00:53:45,363 INFO L226 Difference]: Without dead ends: 344 [2024-10-24 00:53:45,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:53:45,366 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 576 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 1638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:53:45,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 813 Invalid, 1638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:53:45,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-24 00:53:45,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 290. [2024-10-24 00:53:45,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 225 states have (on average 1.5955555555555556) internal successors, (359), 229 states have internal predecessors, (359), 46 states have call successors, (46), 15 states have call predecessors, (46), 18 states have return successors, (53), 45 states have call predecessors, (53), 45 states have call successors, (53) [2024-10-24 00:53:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 458 transitions. [2024-10-24 00:53:45,389 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 458 transitions. Word has length 87 [2024-10-24 00:53:45,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:53:45,389 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 458 transitions. [2024-10-24 00:53:45,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 00:53:45,390 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 458 transitions. [2024-10-24 00:53:45,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 00:53:45,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:53:45,392 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] [2024-10-24 00:53:45,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 00:53:45,392 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:53:45,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:53:45,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1947526505, now seen corresponding path program 1 times [2024-10-24 00:53:45,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:53:45,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074257262] [2024-10-24 00:53:45,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:45,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:53:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:45,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:53:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:45,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:53:45,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:45,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:53:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:45,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:53:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:45,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:53:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:45,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:53:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:45,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:53:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:45,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:53:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:45,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:53:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:45,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:53:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:45,605 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:53:45,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:53:45,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074257262] [2024-10-24 00:53:45,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074257262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:53:45,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:53:45,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 00:53:45,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893560640] [2024-10-24 00:53:45,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:53:45,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 00:53:45,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:53:45,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 00:53:45,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:53:45,608 INFO L87 Difference]: Start difference. First operand 290 states and 458 transitions. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 8 states have internal predecessors, (57), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-24 00:53:47,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:53:47,069 INFO L93 Difference]: Finished difference Result 611 states and 973 transitions. [2024-10-24 00:53:47,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 00:53:47,069 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 8 states have internal predecessors, (57), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 87 [2024-10-24 00:53:47,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:53:47,072 INFO L225 Difference]: With dead ends: 611 [2024-10-24 00:53:47,072 INFO L226 Difference]: Without dead ends: 344 [2024-10-24 00:53:47,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-24 00:53:47,073 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 578 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2529 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 2671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 2529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:53:47,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1173 Invalid, 2671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 2529 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:53:47,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-24 00:53:47,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 290. [2024-10-24 00:53:47,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 225 states have (on average 1.5955555555555556) internal successors, (359), 229 states have internal predecessors, (359), 46 states have call successors, (46), 15 states have call predecessors, (46), 18 states have return successors, (52), 45 states have call predecessors, (52), 45 states have call successors, (52) [2024-10-24 00:53:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 457 transitions. [2024-10-24 00:53:47,091 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 457 transitions. Word has length 87 [2024-10-24 00:53:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:53:47,092 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 457 transitions. [2024-10-24 00:53:47,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 8 states have internal predecessors, (57), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-24 00:53:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 457 transitions. [2024-10-24 00:53:47,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 00:53:47,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:53:47,095 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] [2024-10-24 00:53:47,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 00:53:47,096 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:53:47,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:53:47,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1160114641, now seen corresponding path program 2 times [2024-10-24 00:53:47,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:53:47,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089390607] [2024-10-24 00:53:47,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:47,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:53:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:47,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:53:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:47,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:53:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:47,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:53:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:47,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:53:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:47,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:53:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:47,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:53:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:47,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:53:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:47,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:53:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:47,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:53:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:47,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:53:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:47,302 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:53:47,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:53:47,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089390607] [2024-10-24 00:53:47,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089390607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:53:47,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:53:47,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 00:53:47,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100090607] [2024-10-24 00:53:47,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:53:47,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 00:53:47,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:53:47,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 00:53:47,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:53:47,304 INFO L87 Difference]: Start difference. First operand 290 states and 457 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-24 00:53:48,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:53:48,648 INFO L93 Difference]: Finished difference Result 613 states and 979 transitions. [2024-10-24 00:53:48,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 00:53:48,648 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 88 [2024-10-24 00:53:48,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:53:48,651 INFO L225 Difference]: With dead ends: 613 [2024-10-24 00:53:48,651 INFO L226 Difference]: Without dead ends: 346 [2024-10-24 00:53:48,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-24 00:53:48,653 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 575 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2556 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 00:53:48,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1174 Invalid, 2696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2556 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 00:53:48,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-24 00:53:48,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 292. [2024-10-24 00:53:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 226 states have (on average 1.592920353982301) internal successors, (360), 231 states have internal predecessors, (360), 46 states have call successors, (46), 15 states have call predecessors, (46), 19 states have return successors, (57), 45 states have call predecessors, (57), 45 states have call successors, (57) [2024-10-24 00:53:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 463 transitions. [2024-10-24 00:53:48,671 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 463 transitions. Word has length 88 [2024-10-24 00:53:48,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:53:48,671 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 463 transitions. [2024-10-24 00:53:48,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-24 00:53:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 463 transitions. [2024-10-24 00:53:48,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-24 00:53:48,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:53:48,673 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:53:48,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 00:53:48,673 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:53:48,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:53:48,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1326054436, now seen corresponding path program 1 times [2024-10-24 00:53:48,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:53:48,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649652329] [2024-10-24 00:53:48,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:48,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:53:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:48,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:53:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:48,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:53:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:48,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:53:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:48,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:53:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:48,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:53:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:48,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:53:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:48,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:53:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:48,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:53:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:48,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:53:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:48,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:53:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:48,806 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:53:48,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:53:48,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649652329] [2024-10-24 00:53:48,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649652329] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:53:48,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879813946] [2024-10-24 00:53:48,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:48,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:53:48,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:53:48,808 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:53:48,810 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:53:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:49,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:53:49,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:53:49,104 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:53:49,104 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:53:49,176 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:53:49,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879813946] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:53:49,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:53:49,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-10-24 00:53:49,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220433648] [2024-10-24 00:53:49,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:53:49,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 00:53:49,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:53:49,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 00:53:49,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:53:49,178 INFO L87 Difference]: Start difference. First operand 292 states and 463 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:53:50,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:53:50,251 INFO L93 Difference]: Finished difference Result 754 states and 1264 transitions. [2024-10-24 00:53:50,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 00:53:50,252 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 89 [2024-10-24 00:53:50,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:53:50,258 INFO L225 Difference]: With dead ends: 754 [2024-10-24 00:53:50,258 INFO L226 Difference]: Without dead ends: 656 [2024-10-24 00:53:50,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:53:50,260 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 936 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:53:50,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 975 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:53:50,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-10-24 00:53:50,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 587. [2024-10-24 00:53:50,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 457 states have (on average 1.6411378555798688) internal successors, (750), 462 states have internal predecessors, (750), 110 states have call successors, (110), 15 states have call predecessors, (110), 19 states have return successors, (131), 109 states have call predecessors, (131), 109 states have call successors, (131) [2024-10-24 00:53:50,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 991 transitions. [2024-10-24 00:53:50,290 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 991 transitions. Word has length 89 [2024-10-24 00:53:50,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:53:50,292 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 991 transitions. [2024-10-24 00:53:50,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:53:50,292 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 991 transitions. [2024-10-24 00:53:50,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 00:53:50,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:53:50,296 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] [2024-10-24 00:53:50,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 00:53:50,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:53:50,497 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:53:50,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:53:50,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1557790087, now seen corresponding path program 1 times [2024-10-24 00:53:50,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:53:50,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547819863] [2024-10-24 00:53:50,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:50,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:53:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:50,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:53:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:50,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:53:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:50,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:53:50,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:50,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:53:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:50,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:53:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:50,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:53:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:50,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:53:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:50,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:53:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:50,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:53:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:50,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:53:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:50,604 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:53:50,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:53:50,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547819863] [2024-10-24 00:53:50,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547819863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:53:50,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:53:50,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:53:50,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276683981] [2024-10-24 00:53:50,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:53:50,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:53:50,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:53:50,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:53:50,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:53:50,607 INFO L87 Difference]: Start difference. First operand 587 states and 991 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:53:51,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:53:51,469 INFO L93 Difference]: Finished difference Result 1465 states and 2533 transitions. [2024-10-24 00:53:51,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:53:51,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 95 [2024-10-24 00:53:51,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:53:51,475 INFO L225 Difference]: With dead ends: 1465 [2024-10-24 00:53:51,475 INFO L226 Difference]: Without dead ends: 938 [2024-10-24 00:53:51,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:53:51,479 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 667 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:53:51,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 613 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 00:53:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2024-10-24 00:53:51,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 879. [2024-10-24 00:53:51,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 685 states have (on average 1.6452554744525547) internal successors, (1127), 690 states have internal predecessors, (1127), 174 states have call successors, (174), 15 states have call predecessors, (174), 19 states have return successors, (205), 173 states have call predecessors, (205), 173 states have call successors, (205) [2024-10-24 00:53:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1506 transitions. [2024-10-24 00:53:51,518 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1506 transitions. Word has length 95 [2024-10-24 00:53:51,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:53:51,518 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1506 transitions. [2024-10-24 00:53:51,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:53:51,518 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1506 transitions. [2024-10-24 00:53:51,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 00:53:51,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:53:51,522 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] [2024-10-24 00:53:51,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 00:53:51,522 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:53:51,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:53:51,522 INFO L85 PathProgramCache]: Analyzing trace with hash 578903811, now seen corresponding path program 1 times [2024-10-24 00:53:51,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:53:51,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150602735] [2024-10-24 00:53:51,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:51,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:53:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:51,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:53:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:51,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:53:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:51,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:53:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:51,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:53:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:51,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:53:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:51,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:53:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:51,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:53:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:51,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:53:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:51,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:53:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:51,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:53:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:51,617 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:53:51,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:53:51,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150602735] [2024-10-24 00:53:51,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150602735] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:53:51,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:53:51,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:53:51,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001535323] [2024-10-24 00:53:51,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:53:51,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:53:51,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:53:51,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:53:51,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:53:51,620 INFO L87 Difference]: Start difference. First operand 879 states and 1506 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:53:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:53:52,503 INFO L93 Difference]: Finished difference Result 2162 states and 3760 transitions. [2024-10-24 00:53:52,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:53:52,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 96 [2024-10-24 00:53:52,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:53:52,513 INFO L225 Difference]: With dead ends: 2162 [2024-10-24 00:53:52,513 INFO L226 Difference]: Without dead ends: 1393 [2024-10-24 00:53:52,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:53:52,518 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 665 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:53:52,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 575 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 00:53:52,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-10-24 00:53:52,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1334. [2024-10-24 00:53:52,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 1045 states have (on average 1.64688995215311) internal successors, (1721), 1050 states have internal predecessors, (1721), 269 states have call successors, (269), 15 states have call predecessors, (269), 19 states have return successors, (300), 268 states have call predecessors, (300), 268 states have call successors, (300) [2024-10-24 00:53:52,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 2290 transitions. [2024-10-24 00:53:52,595 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 2290 transitions. Word has length 96 [2024-10-24 00:53:52,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:53:52,596 INFO L471 AbstractCegarLoop]: Abstraction has 1334 states and 2290 transitions. [2024-10-24 00:53:52,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:53:52,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 2290 transitions. [2024-10-24 00:53:52,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 00:53:52,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:53:52,601 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] [2024-10-24 00:53:52,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 00:53:52,602 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:53:52,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:53:52,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1725367707, now seen corresponding path program 1 times [2024-10-24 00:53:52,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:53:52,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241996865] [2024-10-24 00:53:52,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:52,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:53:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:52,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:53:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:52,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:53:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:52,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:53:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:52,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:53:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:52,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:53:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:52,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:53:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:52,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:53:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:52,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:53:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:52,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:53:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:52,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:53:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:52,686 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:53:52,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:53:52,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241996865] [2024-10-24 00:53:52,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241996865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:53:52,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:53:52,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:53:52,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294302003] [2024-10-24 00:53:52,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:53:52,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:53:52,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:53:52,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:53:52,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:53:52,689 INFO L87 Difference]: Start difference. First operand 1334 states and 2290 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:53:53,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:53:53,601 INFO L93 Difference]: Finished difference Result 3180 states and 5572 transitions. [2024-10-24 00:53:53,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:53:53,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 97 [2024-10-24 00:53:53,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:53:53,613 INFO L225 Difference]: With dead ends: 3180 [2024-10-24 00:53:53,614 INFO L226 Difference]: Without dead ends: 2076 [2024-10-24 00:53:53,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:53:53,618 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 663 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:53:53,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 569 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 00:53:53,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2024-10-24 00:53:53,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 2017. [2024-10-24 00:53:53,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 1605 states have (on average 1.649221183800623) internal successors, (2647), 1610 states have internal predecessors, (2647), 392 states have call successors, (392), 15 states have call predecessors, (392), 19 states have return successors, (439), 391 states have call predecessors, (439), 391 states have call successors, (439) [2024-10-24 00:53:53,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 3478 transitions. [2024-10-24 00:53:53,710 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 3478 transitions. Word has length 97 [2024-10-24 00:53:53,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:53:53,710 INFO L471 AbstractCegarLoop]: Abstraction has 2017 states and 3478 transitions. [2024-10-24 00:53:53,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:53:53,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 3478 transitions. [2024-10-24 00:53:53,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 00:53:53,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:53:53,717 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] [2024-10-24 00:53:53,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 00:53:53,718 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:53:53,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:53:53,718 INFO L85 PathProgramCache]: Analyzing trace with hash -69701980, now seen corresponding path program 1 times [2024-10-24 00:53:53,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:53:53,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686459441] [2024-10-24 00:53:53,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:53,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:53:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:53,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:53:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:53,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:53:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:53,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:53:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:53,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:53:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:53,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:53:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:53,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:53:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:53,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:53:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:53,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:53:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:53,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:53:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:53,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:53:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:53,807 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:53:53,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:53:53,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686459441] [2024-10-24 00:53:53,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686459441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:53:53,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:53:53,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:53:53,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892131557] [2024-10-24 00:53:53,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:53:53,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:53:53,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:53:53,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:53:53,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:53:53,810 INFO L87 Difference]: Start difference. First operand 2017 states and 3478 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:53:54,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:53:54,636 INFO L93 Difference]: Finished difference Result 4750 states and 8377 transitions. [2024-10-24 00:53:54,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:53:54,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2024-10-24 00:53:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:53:54,657 INFO L225 Difference]: With dead ends: 4750 [2024-10-24 00:53:54,657 INFO L226 Difference]: Without dead ends: 3160 [2024-10-24 00:53:54,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:53:54,666 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 661 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 00:53:54,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 569 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 00:53:54,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3160 states. [2024-10-24 00:53:54,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3160 to 3101. [2024-10-24 00:53:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3101 states, 2510 states have (on average 1.650597609561753) internal successors, (4143), 2515 states have internal predecessors, (4143), 571 states have call successors, (571), 15 states have call predecessors, (571), 19 states have return successors, (644), 570 states have call predecessors, (644), 570 states have call successors, (644) [2024-10-24 00:53:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 3101 states and 5358 transitions. [2024-10-24 00:53:54,809 INFO L78 Accepts]: Start accepts. Automaton has 3101 states and 5358 transitions. Word has length 98 [2024-10-24 00:53:54,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:53:54,809 INFO L471 AbstractCegarLoop]: Abstraction has 3101 states and 5358 transitions. [2024-10-24 00:53:54,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:53:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand 3101 states and 5358 transitions. [2024-10-24 00:53:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 00:53:54,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:53:54,817 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:53:54,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 00:53:54,817 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:53:54,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:53:54,818 INFO L85 PathProgramCache]: Analyzing trace with hash 489552599, now seen corresponding path program 1 times [2024-10-24 00:53:54,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:53:54,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287798378] [2024-10-24 00:53:54,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:54,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:53:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:54,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:53:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:54,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:53:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:54,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:53:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:54,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:53:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:54,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:53:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:54,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:53:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:54,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:53:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:54,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:53:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:54,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:53:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:54,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:53:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:54,926 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:53:54,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:53:54,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287798378] [2024-10-24 00:53:54,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287798378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:53:54,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:53:54,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:53:54,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130068633] [2024-10-24 00:53:54,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:53:54,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:53:54,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:53:54,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:53:54,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:53:54,928 INFO L87 Difference]: Start difference. First operand 3101 states and 5358 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:53:55,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:53:55,717 INFO L93 Difference]: Finished difference Result 7581 states and 13389 transitions. [2024-10-24 00:53:55,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:53:55,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2024-10-24 00:53:55,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:53:55,752 INFO L225 Difference]: With dead ends: 7581 [2024-10-24 00:53:55,752 INFO L226 Difference]: Without dead ends: 5130 [2024-10-24 00:53:55,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:53:55,765 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 659 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:53:55,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 605 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 00:53:55,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5130 states. [2024-10-24 00:53:56,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5130 to 5071. [2024-10-24 00:53:56,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5071 states, 4104 states have (on average 1.6408382066276803) internal successors, (6734), 4109 states have internal predecessors, (6734), 947 states have call successors, (947), 15 states have call predecessors, (947), 19 states have return successors, (1064), 946 states have call predecessors, (1064), 946 states have call successors, (1064) [2024-10-24 00:53:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5071 states to 5071 states and 8745 transitions. [2024-10-24 00:53:56,040 INFO L78 Accepts]: Start accepts. Automaton has 5071 states and 8745 transitions. Word has length 99 [2024-10-24 00:53:56,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:53:56,041 INFO L471 AbstractCegarLoop]: Abstraction has 5071 states and 8745 transitions. [2024-10-24 00:53:56,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:53:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 5071 states and 8745 transitions. [2024-10-24 00:53:56,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 00:53:56,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:53: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] [2024-10-24 00:53:56,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 00:53:56,053 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:53:56,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:53:56,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1074212200, now seen corresponding path program 1 times [2024-10-24 00:53:56,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:53:56,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822762792] [2024-10-24 00:53:56,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:56,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:53:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:56,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:53:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:56,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:53:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:56,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:53:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:56,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:53:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:56,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:53:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:56,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:53:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:56,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:53:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:56,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:53:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:56,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:53:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:56,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:53:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:56,135 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:53:56,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:53:56,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822762792] [2024-10-24 00:53:56,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822762792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:53:56,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:53:56,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:53:56,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489568545] [2024-10-24 00:53:56,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:53:56,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:53:56,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:53:56,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:53:56,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:53:56,138 INFO L87 Difference]: Start difference. First operand 5071 states and 8745 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:53:57,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:53:57,007 INFO L93 Difference]: Finished difference Result 12562 states and 22137 transitions. [2024-10-24 00:53:57,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:53:57,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 100 [2024-10-24 00:53:57,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:53:57,057 INFO L225 Difference]: With dead ends: 12562 [2024-10-24 00:53:57,057 INFO L226 Difference]: Without dead ends: 8507 [2024-10-24 00:53:57,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:53:57,078 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 657 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:53:57,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 571 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 00:53:57,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8507 states. [2024-10-24 00:53:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8507 to 8448. [2024-10-24 00:53:57,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8448 states, 6875 states have (on average 1.6373818181818183) internal successors, (11257), 6880 states have internal predecessors, (11257), 1553 states have call successors, (1553), 15 states have call predecessors, (1553), 19 states have return successors, (1748), 1552 states have call predecessors, (1748), 1552 states have call successors, (1748) [2024-10-24 00:53:57,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8448 states to 8448 states and 14558 transitions. [2024-10-24 00:53:57,469 INFO L78 Accepts]: Start accepts. Automaton has 8448 states and 14558 transitions. Word has length 100 [2024-10-24 00:53:57,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:53:57,469 INFO L471 AbstractCegarLoop]: Abstraction has 8448 states and 14558 transitions. [2024-10-24 00:53:57,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:53:57,473 INFO L276 IsEmpty]: Start isEmpty. Operand 8448 states and 14558 transitions. [2024-10-24 00:53:57,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 00:53:57,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:53:57,521 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:53:57,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 00:53:57,521 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:53:57,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:53:57,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1101922343, now seen corresponding path program 1 times [2024-10-24 00:53:57,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:53:57,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617229990] [2024-10-24 00:53:57,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:57,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:53:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:57,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:53:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:57,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:53:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:57,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:53:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:57,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:53:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:57,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:53:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:57,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:53:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:57,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:53:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:57,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:53:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:57,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:53:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:57,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:53:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:57,611 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:53:57,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:53:57,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617229990] [2024-10-24 00:53:57,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617229990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:53:57,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:53:57,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:53:57,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568265274] [2024-10-24 00:53:57,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:53:57,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:53:57,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:53:57,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:53:57,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:53:57,613 INFO L87 Difference]: Start difference. First operand 8448 states and 14558 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:53:58,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:53:58,493 INFO L93 Difference]: Finished difference Result 21914 states and 38536 transitions. [2024-10-24 00:53:58,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:53:58,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2024-10-24 00:53:58,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:53:58,560 INFO L225 Difference]: With dead ends: 21914 [2024-10-24 00:53:58,560 INFO L226 Difference]: Without dead ends: 14891 [2024-10-24 00:53:58,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:53:58,593 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 655 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:53:58,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 602 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 00:53:58,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14891 states. [2024-10-24 00:53:59,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14891 to 14832. [2024-10-24 00:53:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14832 states, 12056 states have (on average 1.6269077637690776) internal successors, (19614), 12061 states have internal predecessors, (19614), 2756 states have call successors, (2756), 15 states have call predecessors, (2756), 19 states have return successors, (3095), 2755 states have call predecessors, (3095), 2755 states have call successors, (3095) [2024-10-24 00:53:59,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14832 states to 14832 states and 25465 transitions. [2024-10-24 00:53:59,417 INFO L78 Accepts]: Start accepts. Automaton has 14832 states and 25465 transitions. Word has length 101 [2024-10-24 00:53:59,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:53:59,417 INFO L471 AbstractCegarLoop]: Abstraction has 14832 states and 25465 transitions. [2024-10-24 00:53:59,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:53:59,418 INFO L276 IsEmpty]: Start isEmpty. Operand 14832 states and 25465 transitions. [2024-10-24 00:53:59,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 00:53:59,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:53:59,434 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:53:59,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 00:53:59,435 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:53:59,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:53:59,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1897214121, now seen corresponding path program 1 times [2024-10-24 00:53:59,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:53:59,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778538312] [2024-10-24 00:53:59,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:53:59,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:53:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:59,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:53:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:59,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:53:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:59,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:53:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:59,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:53:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:59,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:53:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:59,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:53:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:59,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:53:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:59,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:53:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:59,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:53:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:59,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:53:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:53:59,520 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:53:59,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:53:59,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778538312] [2024-10-24 00:53:59,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778538312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:53:59,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:53:59,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:53:59,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122500667] [2024-10-24 00:53:59,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:53:59,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:53:59,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:53:59,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:53:59,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:53:59,523 INFO L87 Difference]: Start difference. First operand 14832 states and 25465 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:54:00,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:00,844 INFO L93 Difference]: Finished difference Result 39273 states and 68922 transitions. [2024-10-24 00:54:00,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:54:00,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 102 [2024-10-24 00:54:00,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:00,969 INFO L225 Difference]: With dead ends: 39273 [2024-10-24 00:54:00,969 INFO L226 Difference]: Without dead ends: 26458 [2024-10-24 00:54:01,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:54:01,014 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 653 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:01,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 570 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 00:54:01,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26458 states. [2024-10-24 00:54:02,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26458 to 26399. [2024-10-24 00:54:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26399 states, 21584 states have (on average 1.6224518161601187) internal successors, (35019), 21589 states have internal predecessors, (35019), 4795 states have call successors, (4795), 15 states have call predecessors, (4795), 19 states have return successors, (5408), 4794 states have call predecessors, (5408), 4794 states have call successors, (5408) [2024-10-24 00:54:02,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26399 states to 26399 states and 45222 transitions. [2024-10-24 00:54:02,445 INFO L78 Accepts]: Start accepts. Automaton has 26399 states and 45222 transitions. Word has length 102 [2024-10-24 00:54:02,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:02,446 INFO L471 AbstractCegarLoop]: Abstraction has 26399 states and 45222 transitions. [2024-10-24 00:54:02,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:54:02,446 INFO L276 IsEmpty]: Start isEmpty. Operand 26399 states and 45222 transitions. [2024-10-24 00:54:02,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 00:54:02,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:02,463 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:54:02,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 00:54:02,463 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:02,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:02,464 INFO L85 PathProgramCache]: Analyzing trace with hash 619257147, now seen corresponding path program 1 times [2024-10-24 00:54:02,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:02,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277910775] [2024-10-24 00:54:02,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:02,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:02,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:02,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:02,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:02,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:54:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:02,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:54:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:02,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:54:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:02,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:54:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:02,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:54:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:02,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:54:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:02,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:54:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:02,551 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:54:02,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:02,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277910775] [2024-10-24 00:54:02,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277910775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:54:02,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:54:02,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:54:02,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219560447] [2024-10-24 00:54:02,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:54:02,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:54:02,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:02,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:54:02,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:54:02,554 INFO L87 Difference]: Start difference. First operand 26399 states and 45222 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:54:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:04,550 INFO L93 Difference]: Finished difference Result 71885 states and 125346 transitions. [2024-10-24 00:54:04,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:54:04,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 103 [2024-10-24 00:54:04,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:04,735 INFO L225 Difference]: With dead ends: 71885 [2024-10-24 00:54:04,735 INFO L226 Difference]: Without dead ends: 48218 [2024-10-24 00:54:04,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:54:04,803 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 651 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:04,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 574 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 00:54:04,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48218 states. [2024-10-24 00:54:06,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48218 to 48159. [2024-10-24 00:54:06,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48159 states, 39629 states have (on average 1.616770546821772) internal successors, (64071), 39634 states have internal predecessors, (64071), 8510 states have call successors, (8510), 15 states have call predecessors, (8510), 19 states have return successors, (9655), 8509 states have call predecessors, (9655), 8509 states have call successors, (9655) [2024-10-24 00:54:07,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48159 states to 48159 states and 82236 transitions. [2024-10-24 00:54:07,045 INFO L78 Accepts]: Start accepts. Automaton has 48159 states and 82236 transitions. Word has length 103 [2024-10-24 00:54:07,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:07,046 INFO L471 AbstractCegarLoop]: Abstraction has 48159 states and 82236 transitions. [2024-10-24 00:54:07,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:54:07,046 INFO L276 IsEmpty]: Start isEmpty. Operand 48159 states and 82236 transitions. [2024-10-24 00:54:07,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 00:54:07,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:07,068 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:54:07,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 00:54:07,069 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:07,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:07,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1889739081, now seen corresponding path program 1 times [2024-10-24 00:54:07,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:07,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002706901] [2024-10-24 00:54:07,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:07,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:07,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:07,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:07,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:07,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:54:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:07,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:54:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:07,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:54:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:07,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:54:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:07,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:54:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:07,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:54:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:07,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:54:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:07,177 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:54:07,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:07,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002706901] [2024-10-24 00:54:07,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002706901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:54:07,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:54:07,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:54:07,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078729124] [2024-10-24 00:54:07,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:54:07,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:54:07,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:07,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:54:07,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:54:07,180 INFO L87 Difference]: Start difference. First operand 48159 states and 82236 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:54:09,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:09,832 INFO L93 Difference]: Finished difference Result 89604 states and 156710 transitions. [2024-10-24 00:54:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:54:09,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 104 [2024-10-24 00:54:09,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:10,474 INFO L225 Difference]: With dead ends: 89604 [2024-10-24 00:54:10,474 INFO L226 Difference]: Without dead ends: 89506 [2024-10-24 00:54:10,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:54:10,499 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 646 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:10,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 582 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:54:10,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89506 states. [2024-10-24 00:54:13,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89506 to 89447. [2024-10-24 00:54:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89447 states, 74118 states have (on average 1.6096090018618958) internal successors, (119301), 74123 states have internal predecessors, (119301), 15309 states have call successors, (15309), 15 states have call predecessors, (15309), 19 states have return successors, (17500), 15308 states have call predecessors, (17500), 15308 states have call successors, (17500) [2024-10-24 00:54:13,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89447 states to 89447 states and 152110 transitions. [2024-10-24 00:54:13,693 INFO L78 Accepts]: Start accepts. Automaton has 89447 states and 152110 transitions. Word has length 104 [2024-10-24 00:54:13,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:13,693 INFO L471 AbstractCegarLoop]: Abstraction has 89447 states and 152110 transitions. [2024-10-24 00:54:13,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 00:54:13,694 INFO L276 IsEmpty]: Start isEmpty. Operand 89447 states and 152110 transitions. [2024-10-24 00:54:13,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 00:54:13,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:13,715 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:54:13,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 00:54:13,715 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:13,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:13,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1249778310, now seen corresponding path program 1 times [2024-10-24 00:54:13,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:13,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913983102] [2024-10-24 00:54:13,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:13,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:13,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:13,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:13,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:13,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:54:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:13,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:54:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:13,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:54:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:13,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:54:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:13,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:54:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:13,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:54:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:13,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:54:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:13,851 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:54:13,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:13,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913983102] [2024-10-24 00:54:13,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913983102] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:54:13,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:54:13,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 00:54:13,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306221797] [2024-10-24 00:54:13,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:54:13,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 00:54:13,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:13,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 00:54:13,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 00:54:13,854 INFO L87 Difference]: Start difference. First operand 89447 states and 152110 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 00:54:16,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:16,753 INFO L93 Difference]: Finished difference Result 89499 states and 155470 transitions. [2024-10-24 00:54:16,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:54:16,754 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 105 [2024-10-24 00:54:16,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:16,777 INFO L225 Difference]: With dead ends: 89499 [2024-10-24 00:54:16,777 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 00:54:16,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:54:16,902 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 568 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:16,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 825 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 00:54:16,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 00:54:16,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 00:54:16,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 00:54:16,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 00:54:16,926 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2024-10-24 00:54:16,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:16,927 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 00:54:16,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 00:54:16,927 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 00:54:16,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 00:54:16,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 00:54:16,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 00:54:16,931 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:54:16,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 00:54:23,959 WARN L286 SmtUtils]: Spent 6.95s on a formula simplification. DAG size of input: 1122 DAG size of output: 3 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)