./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec7_product24.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec7_product24.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 312fc8529e2c53d6a3be2cb9c54168ebb93fc3f65452574800e27c42fdf03e19 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:10:12,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:10:12,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:10:12,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:10:12,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:10:13,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:10:13,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:10:13,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:10:13,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:10:13,002 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:10:13,003 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:10:13,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:10:13,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:10:13,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:10:13,006 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:10:13,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:10:13,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:10:13,006 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:10:13,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:10:13,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:10:13,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:10:13,008 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:10:13,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:10:13,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:10:13,010 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:10:13,010 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:10:13,010 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:10:13,011 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:10:13,011 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:10:13,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:10:13,011 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:10:13,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:10:13,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:10:13,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:10:13,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:10:13,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:10:13,012 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:10:13,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:10:13,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:10:13,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:10:13,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:10:13,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:10:13,014 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 -> 312fc8529e2c53d6a3be2cb9c54168ebb93fc3f65452574800e27c42fdf03e19 [2024-11-09 23:10:13,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:10:13,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:10:13,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:10:13,221 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:10:13,221 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:10:13,222 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec7_product24.cil.c [2024-11-09 23:10:14,475 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:10:14,771 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:10:14,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product24.cil.c [2024-11-09 23:10:14,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86b40b653/dd00374c45fe4cc88751c0b98c17aeb1/FLAGa2843a525 [2024-11-09 23:10:15,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86b40b653/dd00374c45fe4cc88751c0b98c17aeb1 [2024-11-09 23:10:15,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:10:15,056 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:10:15,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:10:15,057 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:10:15,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:10:15,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:10:15" (1/1) ... [2024-11-09 23:10:15,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@138342eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:10:15, skipping insertion in model container [2024-11-09 23:10:15,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:10:15" (1/1) ... [2024-11-09 23:10:15,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:10:15,474 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product24.cil.c[62782,62795] [2024-11-09 23:10:15,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:10:15,491 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:10:15,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2024-11-09 23:10:15,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [277] [2024-11-09 23:10:15,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [643] [2024-11-09 23:10:15,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1055] [2024-11-09 23:10:15,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1371] [2024-11-09 23:10:15,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2442] [2024-11-09 23:10:15,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptVerify_spec.i","") [2764] [2024-11-09 23:10:15,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2783] [2024-11-09 23:10:15,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2879] [2024-11-09 23:10:15,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2896] [2024-11-09 23:10:15,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2931] [2024-11-09 23:10:15,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product24.cil.c[62782,62795] [2024-11-09 23:10:15,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:10:15,702 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:10:15,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:10:15 WrapperNode [2024-11-09 23:10:15,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:10:15,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:10:15,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:10:15,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:10:15,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:10:15" (1/1) ... [2024-11-09 23:10:15,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:10:15" (1/1) ... [2024-11-09 23:10:15,760 INFO L138 Inliner]: procedures = 130, calls = 192, calls flagged for inlining = 64, calls inlined = 59, statements flattened = 1052 [2024-11-09 23:10:15,760 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:10:15,761 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:10:15,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:10:15,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:10:15,769 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:10:15" (1/1) ... [2024-11-09 23:10:15,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:10:15" (1/1) ... [2024-11-09 23:10:15,775 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:10:15" (1/1) ... [2024-11-09 23:10:15,791 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-11-09 23:10:15,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:10:15" (1/1) ... [2024-11-09 23:10:15,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:10:15" (1/1) ... [2024-11-09 23:10:15,802 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:10:15" (1/1) ... [2024-11-09 23:10:15,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:10:15" (1/1) ... [2024-11-09 23:10:15,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:10:15" (1/1) ... [2024-11-09 23:10:15,807 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:10:15" (1/1) ... [2024-11-09 23:10:15,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:10:15,812 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:10:15,812 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:10:15,813 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:10:15,813 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:10:15" (1/1) ... [2024-11-09 23:10:15,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:10:15,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:10:15,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 23:10:15,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 23:10:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-09 23:10:15,886 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-09 23:10:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-09 23:10:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-09 23:10:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-09 23:10:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-09 23:10:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-09 23:10:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-09 23:10:15,888 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-09 23:10:15,888 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-09 23:10:15,888 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-09 23:10:15,888 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-09 23:10:15,889 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-09 23:10:15,889 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-09 23:10:15,889 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2024-11-09 23:10:15,889 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2024-11-09 23:10:15,889 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-09 23:10:15,890 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-09 23:10:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:10:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-09 23:10:15,890 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-09 23:10:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-09 23:10:15,890 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-09 23:10:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-09 23:10:15,890 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-09 23:10:15,890 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-09 23:10:15,891 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-09 23:10:15,891 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-09 23:10:15,891 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-09 23:10:15,891 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-09 23:10:15,891 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-09 23:10:15,891 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-09 23:10:15,891 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-09 23:10:15,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:10:15,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 23:10:15,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 23:10:15,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 23:10:15,892 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-09 23:10:15,892 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-09 23:10:15,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:10:15,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:10:16,028 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:10:16,029 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:10:16,068 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L999: #res := ~retValue_acc~12; [2024-11-09 23:10:16,265 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1984-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~24#1; [2024-11-09 23:10:16,265 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036-1: isVerified_#res#1 := isVerified_~retValue_acc~13#1; [2024-11-09 23:10:16,265 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2300-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~29#1; [2024-11-09 23:10:16,265 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1937-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~23#1; [2024-11-09 23:10:16,265 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L699-1: getEmailId_#res#1 := getEmailId_~retValue_acc~4#1; [2024-11-09 23:10:16,265 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2419-1: getClientId_#res#1 := getClientId_~retValue_acc~31#1; [2024-11-09 23:10:16,266 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2651-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~36#1; [2024-11-09 23:10:16,266 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2372-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~30#1; [2024-11-09 23:10:16,270 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L962: #res := ~retValue_acc~11; [2024-11-09 23:10:16,287 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L773: #res := ~retValue_acc~6; [2024-11-09 23:10:16,309 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2076: #res#1 := ~retValue_acc~26#1; [2024-11-09 23:10:16,309 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2031-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~25#1; [2024-11-09 23:10:16,328 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2876-1: createEmail_#res#1 := createEmail_~retValue_acc~39#1; [2024-11-09 23:10:16,539 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2928-1: valid_product_#res#1 := valid_product_~retValue_acc~42#1; [2024-11-09 23:10:16,540 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2617-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~34#1; [2024-11-09 23:10:16,540 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2139-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~27#1; [2024-11-09 23:10:16,540 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2608-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~33#1; [2024-11-09 23:10:16,540 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2246-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~28#1; [2024-11-09 23:10:16,540 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2626-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~35#1; [2024-11-09 23:10:16,546 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L736: #res := ~retValue_acc~5; [2024-11-09 23:10:16,548 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2852: #res := ~retValue_acc~37; [2024-11-09 23:10:16,658 INFO L? ?]: Removed 460 outVars from TransFormulas that were not future-live. [2024-11-09 23:10:16,658 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:10:16,687 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:10:16,687 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:10:16,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:10:16 BoogieIcfgContainer [2024-11-09 23:10:16,687 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:10:16,689 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:10:16,689 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:10:16,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:10:16,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:10:15" (1/3) ... [2024-11-09 23:10:16,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a3eb33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:10:16, skipping insertion in model container [2024-11-09 23:10:16,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:10:15" (2/3) ... [2024-11-09 23:10:16,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a3eb33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:10:16, skipping insertion in model container [2024-11-09 23:10:16,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:10:16" (3/3) ... [2024-11-09 23:10:16,694 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec7_product24.cil.c [2024-11-09 23:10:16,707 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:10:16,707 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:10:16,774 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:10:16,785 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;@6a5f3e8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:10:16,785 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:10:16,793 INFO L276 IsEmpty]: Start isEmpty. Operand has 332 states, 267 states have (on average 1.5131086142322097) internal successors, (404), 269 states have internal predecessors, (404), 46 states have call successors, (46), 17 states have call predecessors, (46), 17 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-09 23:10:16,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-09 23:10:16,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:16,808 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:10:16,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:16,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:16,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1505057127, now seen corresponding path program 1 times [2024-11-09 23:10:16,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:16,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494374177] [2024-11-09 23:10:16,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:16,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:17,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:17,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:17,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:17,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:10:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:17,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:10:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:17,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:10:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:17,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 23:10:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:17,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 23:10:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:17,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 23:10:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:17,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 23:10:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:17,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 23:10:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 23:10:17,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:17,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494374177] [2024-11-09 23:10:17,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494374177] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:10:17,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989505580] [2024-11-09 23:10:17,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:17,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:10:17,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:10:17,469 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:10:17,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 23:10:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:17,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 932 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 23:10:17,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:10:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 23:10:17,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:10:17,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989505580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:17,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:10:17,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-09 23:10:17,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843753781] [2024-11-09 23:10:17,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:17,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:10:17,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:17,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:10:17,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:10:17,794 INFO L87 Difference]: Start difference. First operand has 332 states, 267 states have (on average 1.5131086142322097) internal successors, (404), 269 states have internal predecessors, (404), 46 states have call successors, (46), 17 states have call predecessors, (46), 17 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:17,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:17,832 INFO L93 Difference]: Finished difference Result 494 states and 727 transitions. [2024-11-09 23:10:17,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:10:17,834 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 87 [2024-11-09 23:10:17,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:17,843 INFO L225 Difference]: With dead ends: 494 [2024-11-09 23:10:17,843 INFO L226 Difference]: Without dead ends: 324 [2024-11-09 23:10:17,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:10:17,851 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:17,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:10:17,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-09 23:10:17,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2024-11-09 23:10:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 260 states have (on average 1.5076923076923077) internal successors, (392), 261 states have internal predecessors, (392), 46 states have call successors, (46), 17 states have call predecessors, (46), 17 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 23:10:17,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 483 transitions. [2024-11-09 23:10:17,906 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 483 transitions. Word has length 87 [2024-11-09 23:10:17,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:17,907 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 483 transitions. [2024-11-09 23:10:17,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 483 transitions. [2024-11-09 23:10:17,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 23:10:17,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:17,911 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:10:17,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 23:10:18,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-09 23:10:18,112 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:18,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:18,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1993846239, now seen corresponding path program 1 times [2024-11-09 23:10:18,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:18,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11829572] [2024-11-09 23:10:18,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:18,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:10:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:10:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:10:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 23:10:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 23:10:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 23:10:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 23:10:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 23:10:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 23:10:18,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:18,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11829572] [2024-11-09 23:10:18,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11829572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:10:18,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185104454] [2024-11-09 23:10:18,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:18,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:10:18,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:10:18,421 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:10:18,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 23:10:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 23:10:18,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:10:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 23:10:18,640 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:10:18,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185104454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:18,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:10:18,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-09 23:10:18,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362738601] [2024-11-09 23:10:18,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:18,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:10:18,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:18,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:10:18,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:10:18,642 INFO L87 Difference]: Start difference. First operand 324 states and 483 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:18,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:18,665 INFO L93 Difference]: Finished difference Result 483 states and 707 transitions. [2024-11-09 23:10:18,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:10:18,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2024-11-09 23:10:18,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:18,668 INFO L225 Difference]: With dead ends: 483 [2024-11-09 23:10:18,668 INFO L226 Difference]: Without dead ends: 327 [2024-11-09 23:10:18,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:10:18,670 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 0 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:18,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 962 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:10:18,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-09 23:10:18,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2024-11-09 23:10:18,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 263 states have (on average 1.5019011406844107) internal successors, (395), 264 states have internal predecessors, (395), 46 states have call successors, (46), 17 states have call predecessors, (46), 17 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 23:10:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 486 transitions. [2024-11-09 23:10:18,684 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 486 transitions. Word has length 89 [2024-11-09 23:10:18,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:18,685 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 486 transitions. [2024-11-09 23:10:18,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:18,685 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 486 transitions. [2024-11-09 23:10:18,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 23:10:18,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:18,688 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:10:18,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 23:10:18,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-09 23:10:18,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:18,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:18,889 INFO L85 PathProgramCache]: Analyzing trace with hash -822676843, now seen corresponding path program 1 times [2024-11-09 23:10:18,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:18,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403649076] [2024-11-09 23:10:18,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:18,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:10:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:10:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:10:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 23:10:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 23:10:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 23:10:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 23:10:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 23:10:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,084 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 23:10:19,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:19,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403649076] [2024-11-09 23:10:19,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403649076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:10:19,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187131486] [2024-11-09 23:10:19,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:19,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:10:19,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:10:19,091 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:10:19,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 23:10:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 23:10:19,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:10:19,352 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 23:10:19,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:10:19,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187131486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:19,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:10:19,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-09 23:10:19,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125187579] [2024-11-09 23:10:19,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:19,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:10:19,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:19,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:10:19,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:10:19,354 INFO L87 Difference]: Start difference. First operand 327 states and 486 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:19,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:19,384 INFO L93 Difference]: Finished difference Result 698 states and 1048 transitions. [2024-11-09 23:10:19,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:10:19,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2024-11-09 23:10:19,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:19,387 INFO L225 Difference]: With dead ends: 698 [2024-11-09 23:10:19,387 INFO L226 Difference]: Without dead ends: 399 [2024-11-09 23:10:19,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:10:19,389 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 125 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:19,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 930 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:10:19,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-09 23:10:19,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 391. [2024-11-09 23:10:19,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 316 states have (on average 1.5031645569620253) internal successors, (475), 317 states have internal predecessors, (475), 57 states have call successors, (57), 17 states have call predecessors, (57), 17 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-09 23:10:19,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 588 transitions. [2024-11-09 23:10:19,411 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 588 transitions. Word has length 99 [2024-11-09 23:10:19,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:19,411 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 588 transitions. [2024-11-09 23:10:19,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:19,412 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 588 transitions. [2024-11-09 23:10:19,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 23:10:19,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:19,414 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:10:19,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 23:10:19,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:10:19,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:19,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:19,616 INFO L85 PathProgramCache]: Analyzing trace with hash 447084433, now seen corresponding path program 1 times [2024-11-09 23:10:19,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:19,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046130050] [2024-11-09 23:10:19,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:19,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:10:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:10:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:10:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 23:10:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 23:10:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 23:10:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 23:10:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 23:10:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:19,800 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 23:10:19,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:19,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046130050] [2024-11-09 23:10:19,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046130050] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:10:19,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459258562] [2024-11-09 23:10:19,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:19,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:10:19,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:10:19,802 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:10:19,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 23:10:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:20,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:10:20,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:10:20,085 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 23:10:20,086 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:10:20,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459258562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:20,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:10:20,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-09 23:10:20,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183633360] [2024-11-09 23:10:20,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:20,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:10:20,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:20,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:10:20,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:10:20,088 INFO L87 Difference]: Start difference. First operand 391 states and 588 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 23:10:20,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:20,134 INFO L93 Difference]: Finished difference Result 773 states and 1166 transitions. [2024-11-09 23:10:20,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:10:20,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2024-11-09 23:10:20,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:20,139 INFO L225 Difference]: With dead ends: 773 [2024-11-09 23:10:20,139 INFO L226 Difference]: Without dead ends: 393 [2024-11-09 23:10:20,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:10:20,141 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 2 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:20,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1889 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:10:20,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-09 23:10:20,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-09 23:10:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 317 states have (on average 1.501577287066246) internal successors, (476), 319 states have internal predecessors, (476), 57 states have call successors, (57), 17 states have call predecessors, (57), 18 states have return successors, (58), 56 states have call predecessors, (58), 56 states have call successors, (58) [2024-11-09 23:10:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 591 transitions. [2024-11-09 23:10:20,153 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 591 transitions. Word has length 100 [2024-11-09 23:10:20,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:20,154 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 591 transitions. [2024-11-09 23:10:20,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 23:10:20,154 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 591 transitions. [2024-11-09 23:10:20,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 23:10:20,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:20,155 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:10:20,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 23:10:20,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:10:20,356 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:20,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:20,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1681647029, now seen corresponding path program 1 times [2024-11-09 23:10:20,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:20,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471140760] [2024-11-09 23:10:20,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:20,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:20,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:20,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:20,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:20,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:20,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 23:10:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:20,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:10:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:20,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 23:10:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:20,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 23:10:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:20,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 23:10:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:20,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:10:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:20,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 23:10:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:20,534 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 23:10:20,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:20,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471140760] [2024-11-09 23:10:20,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471140760] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:10:20,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57744204] [2024-11-09 23:10:20,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:20,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:10:20,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:10:20,536 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:10:20,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 23:10:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:20,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 23:10:20,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:10:20,800 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 23:10:20,800 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:10:20,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57744204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:20,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:10:20,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-09 23:10:20,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820925602] [2024-11-09 23:10:20,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:20,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:10:20,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:20,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:10:20,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-09 23:10:20,803 INFO L87 Difference]: Start difference. First operand 393 states and 591 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 23:10:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:20,855 INFO L93 Difference]: Finished difference Result 775 states and 1171 transitions. [2024-11-09 23:10:20,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:10:20,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 101 [2024-11-09 23:10:20,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:20,858 INFO L225 Difference]: With dead ends: 775 [2024-11-09 23:10:20,859 INFO L226 Difference]: Without dead ends: 395 [2024-11-09 23:10:20,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-09 23:10:20,860 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 2 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1875 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:20,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1875 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:10:20,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-09 23:10:20,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-11-09 23:10:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 318 states have (on average 1.5) internal successors, (477), 321 states have internal predecessors, (477), 57 states have call successors, (57), 17 states have call predecessors, (57), 19 states have return successors, (63), 56 states have call predecessors, (63), 56 states have call successors, (63) [2024-11-09 23:10:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 597 transitions. [2024-11-09 23:10:20,878 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 597 transitions. Word has length 101 [2024-11-09 23:10:20,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:20,880 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 597 transitions. [2024-11-09 23:10:20,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 23:10:20,880 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 597 transitions. [2024-11-09 23:10:20,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 23:10:20,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:20,883 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:10:20,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 23:10:21,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:10:21,084 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:21,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:21,084 INFO L85 PathProgramCache]: Analyzing trace with hash 638746125, now seen corresponding path program 1 times [2024-11-09 23:10:21,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:21,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762756310] [2024-11-09 23:10:21,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:21,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:10:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 23:10:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 23:10:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 23:10:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 23:10:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 23:10:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 23:10:21,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:21,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762756310] [2024-11-09 23:10:21,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762756310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:21,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:21,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 23:10:21,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501858586] [2024-11-09 23:10:21,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:21,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:10:21,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:21,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:10:21,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:10:21,249 INFO L87 Difference]: Start difference. First operand 395 states and 597 transitions. Second operand has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 23:10:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:23,132 INFO L93 Difference]: Finished difference Result 953 states and 1457 transitions. [2024-11-09 23:10:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 23:10:23,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2024-11-09 23:10:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:23,135 INFO L225 Difference]: With dead ends: 953 [2024-11-09 23:10:23,135 INFO L226 Difference]: Without dead ends: 581 [2024-11-09 23:10:23,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:10:23,137 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 1036 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 2638 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 2924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 2638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:23,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1252 Invalid, 2924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 2638 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 23:10:23,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-09 23:10:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 395. [2024-11-09 23:10:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 318 states have (on average 1.5) internal successors, (477), 321 states have internal predecessors, (477), 57 states have call successors, (57), 17 states have call predecessors, (57), 19 states have return successors, (62), 56 states have call predecessors, (62), 56 states have call successors, (62) [2024-11-09 23:10:23,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 596 transitions. [2024-11-09 23:10:23,160 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 596 transitions. Word has length 102 [2024-11-09 23:10:23,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:23,160 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 596 transitions. [2024-11-09 23:10:23,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.25) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 23:10:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 596 transitions. [2024-11-09 23:10:23,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 23:10:23,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:23,161 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:10:23,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:10:23,162 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:23,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:23,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1919411663, now seen corresponding path program 2 times [2024-11-09 23:10:23,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:23,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646294688] [2024-11-09 23:10:23,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:23,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 23:10:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 23:10:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 23:10:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 23:10:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 23:10:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 23:10:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 23:10:23,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:23,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646294688] [2024-11-09 23:10:23,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646294688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:23,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:23,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 23:10:23,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158831865] [2024-11-09 23:10:23,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:23,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:10:23,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:23,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:10:23,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:10:23,309 INFO L87 Difference]: Start difference. First operand 395 states and 596 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 23:10:24,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:24,974 INFO L93 Difference]: Finished difference Result 955 states and 1460 transitions. [2024-11-09 23:10:24,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 23:10:24,975 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 103 [2024-11-09 23:10:24,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:24,978 INFO L225 Difference]: With dead ends: 955 [2024-11-09 23:10:24,978 INFO L226 Difference]: Without dead ends: 583 [2024-11-09 23:10:24,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:10:24,979 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 1032 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 2650 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 2936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 2650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:24,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 1252 Invalid, 2936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 2650 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 23:10:24,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-09 23:10:25,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 397. [2024-11-09 23:10:25,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 319 states have (on average 1.4984326018808778) internal successors, (478), 323 states have internal predecessors, (478), 57 states have call successors, (57), 17 states have call predecessors, (57), 20 states have return successors, (64), 56 states have call predecessors, (64), 56 states have call successors, (64) [2024-11-09 23:10:25,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 599 transitions. [2024-11-09 23:10:25,011 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 599 transitions. Word has length 103 [2024-11-09 23:10:25,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:25,011 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 599 transitions. [2024-11-09 23:10:25,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 23:10:25,011 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 599 transitions. [2024-11-09 23:10:25,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 23:10:25,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:25,014 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:10:25,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:10:25,014 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:25,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:25,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1787450282, now seen corresponding path program 1 times [2024-11-09 23:10:25,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:25,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916169304] [2024-11-09 23:10:25,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:25,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:25,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:25,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:25,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:25,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:25,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:25,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:25,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 23:10:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:25,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 23:10:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:25,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 23:10:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:25,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 23:10:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:25,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 23:10:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:25,199 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 23:10:25,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:25,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916169304] [2024-11-09 23:10:25,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916169304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:25,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:25,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 23:10:25,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350478891] [2024-11-09 23:10:25,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:25,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 23:10:25,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:25,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 23:10:25,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:10:25,201 INFO L87 Difference]: Start difference. First operand 397 states and 599 transitions. Second operand has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-09 23:10:27,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:27,485 INFO L93 Difference]: Finished difference Result 953 states and 1455 transitions. [2024-11-09 23:10:27,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:10:27,486 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 104 [2024-11-09 23:10:27,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:27,489 INFO L225 Difference]: With dead ends: 953 [2024-11-09 23:10:27,489 INFO L226 Difference]: Without dead ends: 583 [2024-11-09 23:10:27,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:10:27,491 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1036 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 4360 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 4652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 4360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:27,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1733 Invalid, 4652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 4360 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 23:10:27,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-09 23:10:27,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 397. [2024-11-09 23:10:27,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 319 states have (on average 1.4984326018808778) internal successors, (478), 323 states have internal predecessors, (478), 57 states have call successors, (57), 17 states have call predecessors, (57), 20 states have return successors, (63), 56 states have call predecessors, (63), 56 states have call successors, (63) [2024-11-09 23:10:27,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 598 transitions. [2024-11-09 23:10:27,536 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 598 transitions. Word has length 104 [2024-11-09 23:10:27,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:27,536 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 598 transitions. [2024-11-09 23:10:27,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-09 23:10:27,536 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 598 transitions. [2024-11-09 23:10:27,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 23:10:27,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:27,537 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:10:27,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:10:27,538 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:27,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:27,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1649565686, now seen corresponding path program 2 times [2024-11-09 23:10:27,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:27,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595289195] [2024-11-09 23:10:27,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:27,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:27,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 23:10:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 23:10:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 23:10:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 23:10:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 23:10:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 23:10:27,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:27,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595289195] [2024-11-09 23:10:27,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595289195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:27,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:27,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 23:10:27,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101812871] [2024-11-09 23:10:27,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:27,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 23:10:27,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:27,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 23:10:27,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:10:27,845 INFO L87 Difference]: Start difference. First operand 397 states and 598 transitions. Second operand has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-09 23:10:30,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:30,010 INFO L93 Difference]: Finished difference Result 955 states and 1461 transitions. [2024-11-09 23:10:30,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:10:30,010 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 105 [2024-11-09 23:10:30,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:30,014 INFO L225 Difference]: With dead ends: 955 [2024-11-09 23:10:30,014 INFO L226 Difference]: Without dead ends: 585 [2024-11-09 23:10:30,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:10:30,016 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1032 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 4396 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 4685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 4396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:30,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 1734 Invalid, 4685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 4396 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 23:10:30,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-09 23:10:30,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 399. [2024-11-09 23:10:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 320 states have (on average 1.496875) internal successors, (479), 325 states have internal predecessors, (479), 57 states have call successors, (57), 17 states have call predecessors, (57), 21 states have return successors, (68), 56 states have call predecessors, (68), 56 states have call successors, (68) [2024-11-09 23:10:30,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 604 transitions. [2024-11-09 23:10:30,036 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 604 transitions. Word has length 105 [2024-11-09 23:10:30,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:30,036 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 604 transitions. [2024-11-09 23:10:30,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-09 23:10:30,036 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 604 transitions. [2024-11-09 23:10:30,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 23:10:30,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:30,037 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:10:30,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:10:30,038 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:30,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:30,038 INFO L85 PathProgramCache]: Analyzing trace with hash 2081638087, now seen corresponding path program 1 times [2024-11-09 23:10:30,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:30,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031410291] [2024-11-09 23:10:30,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:30,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:30,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:30,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:30,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:30,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:30,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:30,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:30,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 23:10:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:30,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 23:10:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:30,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 23:10:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:30,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 23:10:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:30,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 23:10:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 23:10:30,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:30,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031410291] [2024-11-09 23:10:30,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031410291] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:10:30,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553886239] [2024-11-09 23:10:30,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:30,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:10:30,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:10:30,242 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:10:30,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 23:10:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:30,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 23:10:30,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:10:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:10:30,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:10:30,576 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:10:30,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553886239] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:10:30,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:10:30,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-11-09 23:10:30,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057481689] [2024-11-09 23:10:30,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:10:30,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 23:10:30,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:30,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 23:10:30,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-09 23:10:30,578 INFO L87 Difference]: Start difference. First operand 399 states and 604 transitions. Second operand has 15 states, 14 states have (on average 8.785714285714286) internal successors, (123), 11 states have internal predecessors, (123), 4 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-09 23:10:33,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:33,225 INFO L93 Difference]: Finished difference Result 1380 states and 2183 transitions. [2024-11-09 23:10:33,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 23:10:33,226 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 8.785714285714286) internal successors, (123), 11 states have internal predecessors, (123), 4 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 106 [2024-11-09 23:10:33,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:33,231 INFO L225 Difference]: With dead ends: 1380 [2024-11-09 23:10:33,231 INFO L226 Difference]: Without dead ends: 1013 [2024-11-09 23:10:33,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2024-11-09 23:10:33,233 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 2252 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 4844 mSolverCounterSat, 573 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2269 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 5417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 573 IncrementalHoareTripleChecker+Valid, 4844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:33,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2269 Valid, 2038 Invalid, 5417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [573 Valid, 4844 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 23:10:33,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2024-11-09 23:10:33,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 803. [2024-11-09 23:10:33,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 660 states have (on average 1.5166666666666666) internal successors, (1001), 665 states have internal predecessors, (1001), 121 states have call successors, (121), 17 states have call predecessors, (121), 21 states have return successors, (142), 120 states have call predecessors, (142), 120 states have call successors, (142) [2024-11-09 23:10:33,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1264 transitions. [2024-11-09 23:10:33,263 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1264 transitions. Word has length 106 [2024-11-09 23:10:33,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:33,263 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1264 transitions. [2024-11-09 23:10:33,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 8.785714285714286) internal successors, (123), 11 states have internal predecessors, (123), 4 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-09 23:10:33,264 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1264 transitions. [2024-11-09 23:10:33,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 23:10:33,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:33,266 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:10:33,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 23:10:33,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:10:33,467 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:33,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:33,467 INFO L85 PathProgramCache]: Analyzing trace with hash -164477133, now seen corresponding path program 1 times [2024-11-09 23:10:33,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:33,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850062939] [2024-11-09 23:10:33,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:33,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 23:10:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 23:10:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 23:10:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 23:10:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 23:10:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,562 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:10:33,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:33,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850062939] [2024-11-09 23:10:33,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850062939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:33,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:33,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:10:33,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398171708] [2024-11-09 23:10:33,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:33,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:10:33,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:33,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:10:33,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:10:33,564 INFO L87 Difference]: Start difference. First operand 803 states and 1264 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:34,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:34,813 INFO L93 Difference]: Finished difference Result 2097 states and 3364 transitions. [2024-11-09 23:10:34,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:10:34,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 117 [2024-11-09 23:10:34,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:34,819 INFO L225 Difference]: With dead ends: 2097 [2024-11-09 23:10:34,819 INFO L226 Difference]: Without dead ends: 1374 [2024-11-09 23:10:34,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:10:34,821 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 1152 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:34,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 968 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 1553 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 23:10:34,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2024-11-09 23:10:34,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1180. [2024-11-09 23:10:34,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 973 states have (on average 1.5190133607399794) internal successors, (1478), 978 states have internal predecessors, (1478), 185 states have call successors, (185), 17 states have call predecessors, (185), 21 states have return successors, (216), 184 states have call predecessors, (216), 184 states have call successors, (216) [2024-11-09 23:10:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1879 transitions. [2024-11-09 23:10:34,894 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1879 transitions. Word has length 117 [2024-11-09 23:10:34,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:34,894 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1879 transitions. [2024-11-09 23:10:34,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:34,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1879 transitions. [2024-11-09 23:10:34,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 23:10:34,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:34,897 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:10:34,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:10:34,897 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:34,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:34,898 INFO L85 PathProgramCache]: Analyzing trace with hash 379834235, now seen corresponding path program 1 times [2024-11-09 23:10:34,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:34,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520050982] [2024-11-09 23:10:34,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:34,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:34,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:34,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:34,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:34,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:34,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:34,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:34,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 23:10:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:34,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 23:10:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:34,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 23:10:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:34,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 23:10:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:34,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 23:10:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:34,989 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:10:34,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:34,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520050982] [2024-11-09 23:10:34,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520050982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:34,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:34,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:10:34,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057184154] [2024-11-09 23:10:34,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:34,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:10:34,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:34,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:10:34,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:10:34,991 INFO L87 Difference]: Start difference. First operand 1180 states and 1879 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:36,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:36,256 INFO L93 Difference]: Finished difference Result 3032 states and 4878 transitions. [2024-11-09 23:10:36,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:10:36,256 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 118 [2024-11-09 23:10:36,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:36,272 INFO L225 Difference]: With dead ends: 3032 [2024-11-09 23:10:36,272 INFO L226 Difference]: Without dead ends: 1991 [2024-11-09 23:10:36,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:10:36,278 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 1149 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:36,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 915 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 23:10:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2024-11-09 23:10:36,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1797. [2024-11-09 23:10:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1495 states have (on average 1.517056856187291) internal successors, (2268), 1500 states have internal predecessors, (2268), 280 states have call successors, (280), 17 states have call predecessors, (280), 21 states have return successors, (311), 279 states have call predecessors, (311), 279 states have call successors, (311) [2024-11-09 23:10:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2859 transitions. [2024-11-09 23:10:36,394 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2859 transitions. Word has length 118 [2024-11-09 23:10:36,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:36,394 INFO L471 AbstractCegarLoop]: Abstraction has 1797 states and 2859 transitions. [2024-11-09 23:10:36,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:36,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2859 transitions. [2024-11-09 23:10:36,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 23:10:36,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:36,404 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:10:36,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:10:36,404 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:36,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:36,405 INFO L85 PathProgramCache]: Analyzing trace with hash -482670797, now seen corresponding path program 1 times [2024-11-09 23:10:36,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:36,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072651575] [2024-11-09 23:10:36,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:36,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:36,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:36,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:36,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:36,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:36,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:36,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:36,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 23:10:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:36,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 23:10:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:36,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 23:10:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:36,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 23:10:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:36,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 23:10:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:36,523 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:10:36,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:36,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072651575] [2024-11-09 23:10:36,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072651575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:36,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:36,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:10:36,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767609626] [2024-11-09 23:10:36,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:36,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:10:36,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:36,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:10:36,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:10:36,526 INFO L87 Difference]: Start difference. First operand 1797 states and 2859 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:37,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:37,806 INFO L93 Difference]: Finished difference Result 4446 states and 7171 transitions. [2024-11-09 23:10:37,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:10:37,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 119 [2024-11-09 23:10:37,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:37,817 INFO L225 Difference]: With dead ends: 4446 [2024-11-09 23:10:37,818 INFO L226 Difference]: Without dead ends: 2937 [2024-11-09 23:10:37,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:10:37,823 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 1146 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 1863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:37,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 915 Invalid, 1863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 23:10:37,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2024-11-09 23:10:37,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 2743. [2024-11-09 23:10:37,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2743 states, 2318 states have (on average 1.5150992234685072) internal successors, (3512), 2323 states have internal predecessors, (3512), 403 states have call successors, (403), 17 states have call predecessors, (403), 21 states have return successors, (450), 402 states have call predecessors, (450), 402 states have call successors, (450) [2024-11-09 23:10:37,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2743 states to 2743 states and 4365 transitions. [2024-11-09 23:10:37,904 INFO L78 Accepts]: Start accepts. Automaton has 2743 states and 4365 transitions. Word has length 119 [2024-11-09 23:10:37,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:37,904 INFO L471 AbstractCegarLoop]: Abstraction has 2743 states and 4365 transitions. [2024-11-09 23:10:37,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:37,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2743 states and 4365 transitions. [2024-11-09 23:10:37,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 23:10:37,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:37,910 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:10:37,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:10:37,910 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:37,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:37,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1740496613, now seen corresponding path program 1 times [2024-11-09 23:10:37,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:37,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43790499] [2024-11-09 23:10:37,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:37,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:37,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:37,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:37,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:37,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:37,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:37,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:37,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 23:10:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:37,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 23:10:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:37,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 23:10:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:37,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 23:10:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:37,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 23:10:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:37,992 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:10:37,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:37,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43790499] [2024-11-09 23:10:37,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43790499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:37,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:37,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:10:37,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112536780] [2024-11-09 23:10:37,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:37,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:10:37,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:37,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:10:37,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:10:37,993 INFO L87 Difference]: Start difference. First operand 2743 states and 4365 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:39,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:39,259 INFO L93 Difference]: Finished difference Result 6672 states and 10773 transitions. [2024-11-09 23:10:39,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:10:39,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 120 [2024-11-09 23:10:39,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:39,276 INFO L225 Difference]: With dead ends: 6672 [2024-11-09 23:10:39,276 INFO L226 Difference]: Without dead ends: 4462 [2024-11-09 23:10:39,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:10:39,281 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1143 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 1513 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 1851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 1513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:39,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 913 Invalid, 1851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 1513 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 23:10:39,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4462 states. [2024-11-09 23:10:39,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4462 to 4268. [2024-11-09 23:10:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4268 states, 3664 states have (on average 1.5122816593886463) internal successors, (5541), 3669 states have internal predecessors, (5541), 582 states have call successors, (582), 17 states have call predecessors, (582), 21 states have return successors, (655), 581 states have call predecessors, (655), 581 states have call successors, (655) [2024-11-09 23:10:39,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4268 states to 4268 states and 6778 transitions. [2024-11-09 23:10:39,413 INFO L78 Accepts]: Start accepts. Automaton has 4268 states and 6778 transitions. Word has length 120 [2024-11-09 23:10:39,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:39,413 INFO L471 AbstractCegarLoop]: Abstraction has 4268 states and 6778 transitions. [2024-11-09 23:10:39,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 4268 states and 6778 transitions. [2024-11-09 23:10:39,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 23:10:39,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:39,419 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:10:39,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 23:10:39,419 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:39,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:39,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1375377709, now seen corresponding path program 1 times [2024-11-09 23:10:39,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:39,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259740561] [2024-11-09 23:10:39,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:39,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:39,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:39,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:39,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:39,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:39,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:39,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:39,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 23:10:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:39,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 23:10:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:39,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 23:10:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:39,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 23:10:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:39,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 23:10:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:10:39,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:39,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259740561] [2024-11-09 23:10:39,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259740561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:39,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:39,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:10:39,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668187617] [2024-11-09 23:10:39,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:39,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:10:39,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:39,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:10:39,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:10:39,510 INFO L87 Difference]: Start difference. First operand 4268 states and 6778 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:40,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:40,867 INFO L93 Difference]: Finished difference Result 10370 states and 16732 transitions. [2024-11-09 23:10:40,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:10:40,867 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 121 [2024-11-09 23:10:40,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:40,893 INFO L225 Difference]: With dead ends: 10370 [2024-11-09 23:10:40,893 INFO L226 Difference]: Without dead ends: 7009 [2024-11-09 23:10:40,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:10:40,903 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 1140 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 1882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:40,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 936 Invalid, 1882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 23:10:40,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7009 states. [2024-11-09 23:10:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7009 to 6815. [2024-11-09 23:10:41,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6815 states, 5835 states have (on average 1.5000856898029133) internal successors, (8753), 5840 states have internal predecessors, (8753), 958 states have call successors, (958), 17 states have call predecessors, (958), 21 states have return successors, (1075), 957 states have call predecessors, (1075), 957 states have call successors, (1075) [2024-11-09 23:10:41,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6815 states to 6815 states and 10786 transitions. [2024-11-09 23:10:41,106 INFO L78 Accepts]: Start accepts. Automaton has 6815 states and 10786 transitions. Word has length 121 [2024-11-09 23:10:41,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:41,106 INFO L471 AbstractCegarLoop]: Abstraction has 6815 states and 10786 transitions. [2024-11-09 23:10:41,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:41,106 INFO L276 IsEmpty]: Start isEmpty. Operand 6815 states and 10786 transitions. [2024-11-09 23:10:41,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 23:10:41,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:41,116 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:10:41,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:10:41,116 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:41,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:41,117 INFO L85 PathProgramCache]: Analyzing trace with hash -960818629, now seen corresponding path program 1 times [2024-11-09 23:10:41,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:41,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327563134] [2024-11-09 23:10:41,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:41,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:41,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:41,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:41,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:41,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:41,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:41,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:41,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 23:10:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:41,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:10:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:41,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 23:10:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:41,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-09 23:10:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:41,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-09 23:10:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:10:41,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:41,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327563134] [2024-11-09 23:10:41,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327563134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:41,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:41,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:10:41,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902815042] [2024-11-09 23:10:41,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:41,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:10:41,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:41,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:10:41,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:10:41,241 INFO L87 Difference]: Start difference. First operand 6815 states and 10786 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:42,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:42,650 INFO L93 Difference]: Finished difference Result 17073 states and 27431 transitions. [2024-11-09 23:10:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:10:42,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 122 [2024-11-09 23:10:42,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:42,701 INFO L225 Difference]: With dead ends: 17073 [2024-11-09 23:10:42,701 INFO L226 Difference]: Without dead ends: 11629 [2024-11-09 23:10:42,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:10:42,720 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 1137 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:42,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 923 Invalid, 1876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 23:10:42,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11629 states. [2024-11-09 23:10:43,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11629 to 11435. [2024-11-09 23:10:43,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11435 states, 9849 states have (on average 1.4939587775408671) internal successors, (14714), 9854 states have internal predecessors, (14714), 1564 states have call successors, (1564), 17 states have call predecessors, (1564), 21 states have return successors, (1759), 1563 states have call predecessors, (1759), 1563 states have call successors, (1759) [2024-11-09 23:10:43,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11435 states to 11435 states and 18037 transitions. [2024-11-09 23:10:43,081 INFO L78 Accepts]: Start accepts. Automaton has 11435 states and 18037 transitions. Word has length 122 [2024-11-09 23:10:43,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:43,081 INFO L471 AbstractCegarLoop]: Abstraction has 11435 states and 18037 transitions. [2024-11-09 23:10:43,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 11435 states and 18037 transitions. [2024-11-09 23:10:43,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 23:10:43,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:43,092 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:10:43,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 23:10:43,092 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:43,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:43,093 INFO L85 PathProgramCache]: Analyzing trace with hash -58490157, now seen corresponding path program 1 times [2024-11-09 23:10:43,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:43,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51062743] [2024-11-09 23:10:43,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:43,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:43,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:43,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:43,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:43,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:43,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:43,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:43,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 23:10:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:43,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 23:10:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:43,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 23:10:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:43,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 23:10:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:43,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 23:10:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:10:43,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:43,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51062743] [2024-11-09 23:10:43,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51062743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:43,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:43,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:10:43,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325194905] [2024-11-09 23:10:43,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:43,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:10:43,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:43,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:10:43,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:10:43,250 INFO L87 Difference]: Start difference. First operand 11435 states and 18037 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:44,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:44,678 INFO L93 Difference]: Finished difference Result 29837 states and 47767 transitions. [2024-11-09 23:10:44,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:10:44,679 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 123 [2024-11-09 23:10:44,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:44,732 INFO L225 Difference]: With dead ends: 29837 [2024-11-09 23:10:44,732 INFO L226 Difference]: Without dead ends: 20341 [2024-11-09 23:10:44,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:10:44,751 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 1134 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 1548 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 1898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:44,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 947 Invalid, 1898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1548 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 23:10:44,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20341 states. [2024-11-09 23:10:45,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20341 to 20147. [2024-11-09 23:10:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20147 states, 17358 states have (on average 1.4839843299919346) internal successors, (25759), 17363 states have internal predecessors, (25759), 2767 states have call successors, (2767), 17 states have call predecessors, (2767), 21 states have return successors, (3106), 2766 states have call predecessors, (3106), 2766 states have call successors, (3106) [2024-11-09 23:10:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20147 states to 20147 states and 31632 transitions. [2024-11-09 23:10:45,254 INFO L78 Accepts]: Start accepts. Automaton has 20147 states and 31632 transitions. Word has length 123 [2024-11-09 23:10:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:45,254 INFO L471 AbstractCegarLoop]: Abstraction has 20147 states and 31632 transitions. [2024-11-09 23:10:45,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 20147 states and 31632 transitions. [2024-11-09 23:10:45,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 23:10:45,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:45,265 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:10:45,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 23:10:45,265 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:45,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:45,266 INFO L85 PathProgramCache]: Analyzing trace with hash -880770917, now seen corresponding path program 1 times [2024-11-09 23:10:45,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:45,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621501426] [2024-11-09 23:10:45,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:45,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:45,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:45,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:45,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:45,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:45,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:45,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:45,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 23:10:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:45,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 23:10:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:45,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 23:10:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:45,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 23:10:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:45,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 23:10:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:10:45,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:45,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621501426] [2024-11-09 23:10:45,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621501426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:45,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:45,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:10:45,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118928046] [2024-11-09 23:10:45,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:45,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:10:45,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:45,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:10:45,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:10:45,365 INFO L87 Difference]: Start difference. First operand 20147 states and 31632 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:47,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:47,314 INFO L93 Difference]: Finished difference Result 53795 states and 85762 transitions. [2024-11-09 23:10:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:10:47,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 124 [2024-11-09 23:10:47,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:47,408 INFO L225 Difference]: With dead ends: 53795 [2024-11-09 23:10:47,408 INFO L226 Difference]: Without dead ends: 36378 [2024-11-09 23:10:47,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:10:47,444 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 1131 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:47,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 916 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 23:10:47,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36378 states. [2024-11-09 23:10:48,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36378 to 36184. [2024-11-09 23:10:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36184 states, 31356 states have (on average 1.4771973466003316) internal successors, (46319), 31361 states have internal predecessors, (46319), 4806 states have call successors, (4806), 17 states have call predecessors, (4806), 21 states have return successors, (5419), 4805 states have call predecessors, (5419), 4805 states have call successors, (5419) [2024-11-09 23:10:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36184 states to 36184 states and 56544 transitions. [2024-11-09 23:10:48,439 INFO L78 Accepts]: Start accepts. Automaton has 36184 states and 56544 transitions. Word has length 124 [2024-11-09 23:10:48,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:48,440 INFO L471 AbstractCegarLoop]: Abstraction has 36184 states and 56544 transitions. [2024-11-09 23:10:48,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:48,440 INFO L276 IsEmpty]: Start isEmpty. Operand 36184 states and 56544 transitions. [2024-11-09 23:10:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 23:10:48,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:48,452 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:10:48,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 23:10:48,452 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:48,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:48,453 INFO L85 PathProgramCache]: Analyzing trace with hash -31508749, now seen corresponding path program 1 times [2024-11-09 23:10:48,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:48,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009433848] [2024-11-09 23:10:48,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:48,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:48,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:48,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:48,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:48,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:48,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:48,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:48,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:48,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 23:10:48,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:48,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 23:10:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:48,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 23:10:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:48,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 23:10:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:48,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 23:10:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:48,555 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:10:48,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:48,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009433848] [2024-11-09 23:10:48,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009433848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:48,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:48,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:10:48,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252680533] [2024-11-09 23:10:48,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:48,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:10:48,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:48,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:10:48,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:10:48,558 INFO L87 Difference]: Start difference. First operand 36184 states and 56544 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:51,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:51,024 INFO L93 Difference]: Finished difference Result 99359 states and 157113 transitions. [2024-11-09 23:10:51,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:10:51,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 125 [2024-11-09 23:10:51,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:51,218 INFO L225 Difference]: With dead ends: 99359 [2024-11-09 23:10:51,218 INFO L226 Difference]: Without dead ends: 66863 [2024-11-09 23:10:51,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:10:51,302 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 1128 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 1875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:51,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 922 Invalid, 1875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 1529 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 23:10:51,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66863 states. [2024-11-09 23:10:52,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66863 to 66669. [2024-11-09 23:10:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66669 states, 58126 states have (on average 1.4696693390221243) internal successors, (85426), 58131 states have internal predecessors, (85426), 8521 states have call successors, (8521), 17 states have call predecessors, (8521), 21 states have return successors, (9666), 8520 states have call predecessors, (9666), 8520 states have call successors, (9666) [2024-11-09 23:10:53,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66669 states to 66669 states and 103613 transitions. [2024-11-09 23:10:53,148 INFO L78 Accepts]: Start accepts. Automaton has 66669 states and 103613 transitions. Word has length 125 [2024-11-09 23:10:53,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:53,149 INFO L471 AbstractCegarLoop]: Abstraction has 66669 states and 103613 transitions. [2024-11-09 23:10:53,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:53,149 INFO L276 IsEmpty]: Start isEmpty. Operand 66669 states and 103613 transitions. [2024-11-09 23:10:53,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 23:10:53,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:53,164 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:10:53,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 23:10:53,164 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:53,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:53,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1546977947, now seen corresponding path program 1 times [2024-11-09 23:10:53,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:53,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179422456] [2024-11-09 23:10:53,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:53,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:53,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:53,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:53,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:53,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:53,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:53,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:53,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 23:10:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:53,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 23:10:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:53,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 23:10:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:53,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 23:10:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:53,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-09 23:10:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:10:53,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:53,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179422456] [2024-11-09 23:10:53,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179422456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:53,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:53,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:10:53,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398769326] [2024-11-09 23:10:53,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:53,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:10:53,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:53,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:10:53,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:10:53,519 INFO L87 Difference]: Start difference. First operand 66669 states and 103613 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:10:56,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:56,671 INFO L93 Difference]: Finished difference Result 125508 states and 198192 transitions. [2024-11-09 23:10:56,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:10:56,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 126 [2024-11-09 23:10:56,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:57,021 INFO L225 Difference]: With dead ends: 125508 [2024-11-09 23:10:57,021 INFO L226 Difference]: Without dead ends: 125352 [2024-11-09 23:10:57,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:10:57,058 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 1122 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:57,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 954 Invalid, 1874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 1537 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 23:10:57,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125352 states. [2024-11-09 23:11:00,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125352 to 125158. [2024-11-09 23:11:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125158 states, 109816 states have (on average 1.461280687695782) internal successors, (160472), 109821 states have internal predecessors, (160472), 15320 states have call successors, (15320), 17 states have call predecessors, (15320), 21 states have return successors, (17511), 15319 states have call predecessors, (17511), 15319 states have call successors, (17511) [2024-11-09 23:11:00,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125158 states to 125158 states and 193303 transitions. [2024-11-09 23:11:00,971 INFO L78 Accepts]: Start accepts. Automaton has 125158 states and 193303 transitions. Word has length 126 [2024-11-09 23:11:00,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:11:00,973 INFO L471 AbstractCegarLoop]: Abstraction has 125158 states and 193303 transitions. [2024-11-09 23:11:00,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:11:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand 125158 states and 193303 transitions. [2024-11-09 23:11:01,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 23:11:01,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:11:01,005 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:11:01,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 23:11:01,005 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:11:01,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:11:01,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2107780883, now seen corresponding path program 1 times [2024-11-09 23:11:01,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:11:01,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015099676] [2024-11-09 23:11:01,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:11:01,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:11:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:11:01,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:11:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:11:01,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:11:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:11:01,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:11:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:11:01,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:11:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:11:01,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:11:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:11:01,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:11:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:11:01,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:11:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:11:01,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 23:11:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:11:01,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 23:11:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:11:01,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 23:11:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:11:01,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 23:11:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:11:01,761 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:11:01,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:11:01,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015099676] [2024-11-09 23:11:01,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015099676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:11:01,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:11:01,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 23:11:01,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711664385] [2024-11-09 23:11:01,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:11:01,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:11:01,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:11:01,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:11:01,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:11:01,763 INFO L87 Difference]: Start difference. First operand 125158 states and 193303 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 23:11:05,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:11:05,208 INFO L93 Difference]: Finished difference Result 125341 states and 196866 transitions. [2024-11-09 23:11:05,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 23:11:05,209 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 127 [2024-11-09 23:11:05,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:11:05,238 INFO L225 Difference]: With dead ends: 125341 [2024-11-09 23:11:05,238 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 23:11:05,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2024-11-09 23:11:05,401 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 1019 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 2608 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 2608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:11:05,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 1253 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 2608 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 23:11:05,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 23:11:05,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 23:11:05,402 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-11-09 23:11:05,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 23:11:05,427 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2024-11-09 23:11:05,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:11:05,427 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 23:11:05,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 23:11:05,428 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 23:11:05,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 23:11:05,430 INFO L782 garLoopResultBuilder]: Registering result SAFE for location outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 23:11:05,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 23:11:05,433 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] [2024-11-09 23:11:05,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.