./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec7_product18.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_product18.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 f70ac21a1decd51d5f9571a5be4450629a9ca28f5aa1158e9564f33ba44bf6ef --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:09:59,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:09:59,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:09:59,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:09:59,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:09:59,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:09:59,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:09:59,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:09:59,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:09:59,495 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:09:59,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:09:59,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:09:59,497 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:09:59,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:09:59,499 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:09:59,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:09:59,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:09:59,500 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:09:59,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:09:59,501 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:09:59,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:09:59,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:09:59,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:09:59,504 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:09:59,504 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:09:59,504 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:09:59,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:09:59,505 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:09:59,505 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:09:59,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:09:59,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:09:59,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:09:59,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:09:59,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:09:59,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:09:59,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:09:59,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:09:59,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:09:59,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:09:59,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:09:59,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:09:59,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:09:59,509 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 -> f70ac21a1decd51d5f9571a5be4450629a9ca28f5aa1158e9564f33ba44bf6ef [2024-11-09 23:09:59,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:09:59,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:09:59,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:09:59,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:09:59,783 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:09:59,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec7_product18.cil.c [2024-11-09 23:10:01,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:10:01,596 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:10:01,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product18.cil.c [2024-11-09 23:10:01,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8210fb2f/87653d61d50b45cc9976679ebf36daaa/FLAGabd5fd0e7 [2024-11-09 23:10:01,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8210fb2f/87653d61d50b45cc9976679ebf36daaa [2024-11-09 23:10:01,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:10:01,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:10:01,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:10:01,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:10:01,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:10:01,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:10:01" (1/1) ... [2024-11-09 23:10:01,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@129ccf28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:10:01, skipping insertion in model container [2024-11-09 23:10:01,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:10:01" (1/1) ... [2024-11-09 23:10:01,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:10:02,216 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_product18.cil.c[45803,45816] [2024-11-09 23:10:02,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:10:02,359 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:10:02,370 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2024-11-09 23:10:02,372 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [66] [2024-11-09 23:10:02,372 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [432] [2024-11-09 23:10:02,373 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [481] [2024-11-09 23:10:02,373 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1561] [2024-11-09 23:10:02,373 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1973] [2024-11-09 23:10:02,373 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1982] [2024-11-09 23:10:02,373 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2274] [2024-11-09 23:10:02,374 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2373] [2024-11-09 23:10:02,374 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2658] [2024-11-09 23:10:02,375 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptVerify_spec.i","") [2874] [2024-11-09 23:10:02,435 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_product18.cil.c[45803,45816] [2024-11-09 23:10:02,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:10:02,502 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:10:02,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:10:02 WrapperNode [2024-11-09 23:10:02,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:10:02,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:10:02,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:10:02,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:10:02,511 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:02" (1/1) ... [2024-11-09 23:10:02,543 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:02" (1/1) ... [2024-11-09 23:10:02,592 INFO L138 Inliner]: procedures = 127, calls = 184, calls flagged for inlining = 59, calls inlined = 50, statements flattened = 905 [2024-11-09 23:10:02,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:10:02,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:10:02,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:10:02,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:10:02,605 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:02" (1/1) ... [2024-11-09 23:10:02,606 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:02" (1/1) ... [2024-11-09 23:10:02,611 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:02" (1/1) ... [2024-11-09 23:10:02,653 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:02,654 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:02" (1/1) ... [2024-11-09 23:10:02,654 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:02" (1/1) ... [2024-11-09 23:10:02,680 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:02" (1/1) ... [2024-11-09 23:10:02,682 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:02" (1/1) ... [2024-11-09 23:10:02,689 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:02" (1/1) ... [2024-11-09 23:10:02,695 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:02" (1/1) ... [2024-11-09 23:10:02,706 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:10:02,707 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:10:02,707 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:10:02,707 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:10:02,710 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:10:02" (1/1) ... [2024-11-09 23:10:02,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:10:02,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:10:02,748 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:02,755 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:02,799 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-09 23:10:02,799 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-09 23:10:02,799 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-09 23:10:02,799 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-09 23:10:02,800 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-09 23:10:02,800 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-09 23:10:02,800 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-09 23:10:02,800 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-09 23:10:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-09 23:10:02,801 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-09 23:10:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-09 23:10:02,801 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-09 23:10:02,801 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-09 23:10:02,831 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-09 23:10:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-09 23:10:02,831 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-09 23:10:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:10:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-09 23:10:02,831 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-09 23:10:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-09 23:10:02,831 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-09 23:10:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-09 23:10:02,831 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-09 23:10:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-09 23:10:02,832 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-09 23:10:02,832 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-09 23:10:02,832 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-09 23:10:02,832 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-09 23:10:02,832 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-09 23:10:02,832 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-09 23:10:02,832 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-09 23:10:02,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:10:02,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 23:10:02,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 23:10:02,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 23:10:02,832 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-09 23:10:02,833 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-09 23:10:02,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:10:02,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:10:03,093 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:10:03,096 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:10:03,160 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1917: #res := ~retValue_acc~32; [2024-11-09 23:10:03,431 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1538-1: getClientId_#res#1 := getClientId_~retValue_acc~22#1; [2024-11-09 23:10:03,431 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1103-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~15#1; [2024-11-09 23:10:03,431 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2557-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~42#1; [2024-11-09 23:10:03,431 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1419-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~20#1; [2024-11-09 23:10:03,431 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1056-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~14#1; [2024-11-09 23:10:03,444 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1880: #res := ~retValue_acc~31; [2024-11-09 23:10:03,487 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1691: #res := ~retValue_acc~26; [2024-11-09 23:10:03,525 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1150-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~16#1; [2024-11-09 23:10:03,526 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1195: #res#1 := ~retValue_acc~17#1; [2024-11-09 23:10:03,572 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2370-1: createEmail_#res#1 := createEmail_~retValue_acc~37#1; [2024-11-09 23:10:03,835 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1365-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~19#1; [2024-11-09 23:10:03,835 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1258-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~18#1; [2024-11-09 23:10:03,835 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2514-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~39#1; [2024-11-09 23:10:03,835 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2523-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~40#1; [2024-11-09 23:10:03,835 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2532-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~41#1; [2024-11-09 23:10:03,835 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L478-1: valid_product_#res#1 := valid_product_~retValue_acc~5#1; [2024-11-09 23:10:03,844 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1654: #res := ~retValue_acc~25; [2024-11-09 23:10:03,850 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2346: #res := ~retValue_acc~35; [2024-11-09 23:10:03,986 INFO L? ?]: Removed 396 outVars from TransFormulas that were not future-live. [2024-11-09 23:10:03,987 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:10:04,009 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:10:04,011 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:10:04,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:10:04 BoogieIcfgContainer [2024-11-09 23:10:04,012 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:10:04,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:10:04,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:10:04,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:10:04,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:10:01" (1/3) ... [2024-11-09 23:10:04,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb7c5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:10:04, skipping insertion in model container [2024-11-09 23:10:04,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:10:02" (2/3) ... [2024-11-09 23:10:04,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fb7c5e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:10:04, skipping insertion in model container [2024-11-09 23:10:04,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:10:04" (3/3) ... [2024-11-09 23:10:04,020 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec7_product18.cil.c [2024-11-09 23:10:04,033 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:10:04,033 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:10:04,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:10:04,131 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;@7b695eee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:10:04,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:10:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 296 states, 240 states have (on average 1.525) internal successors, (366), 242 states have internal predecessors, (366), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-09 23:10:04,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-09 23:10:04,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:04,182 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:04,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:04,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:04,188 INFO L85 PathProgramCache]: Analyzing trace with hash -140397351, now seen corresponding path program 1 times [2024-11-09 23:10:04,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:04,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584610950] [2024-11-09 23:10:04,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:04,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:04,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:04,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:04,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:04,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:10:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:04,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:10:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:04,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:10:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:04,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 23:10:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:05,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 23:10:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:05,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 23:10:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:05,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 23:10:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:05,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 23:10:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:05,040 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:05,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:05,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584610950] [2024-11-09 23:10:05,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584610950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:10:05,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029650141] [2024-11-09 23:10:05,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:05,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:10:05,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:10:05,046 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:05,047 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:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:05,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 932 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 23:10:05,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:10:05,413 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:05,414 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:10:05,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029650141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:05,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:10:05,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-09 23:10:05,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508874330] [2024-11-09 23:10:05,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:05,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:10:05,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:05,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:10:05,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:10:05,461 INFO L87 Difference]: Start difference. First operand has 296 states, 240 states have (on average 1.525) internal successors, (366), 242 states have internal predecessors, (366), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) 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:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:05,512 INFO L93 Difference]: Finished difference Result 427 states and 627 transitions. [2024-11-09 23:10:05,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:10:05,515 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:05,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:05,533 INFO L225 Difference]: With dead ends: 427 [2024-11-09 23:10:05,534 INFO L226 Difference]: Without dead ends: 288 [2024-11-09 23:10:05,544 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:05,550 INFO L432 NwaCegarLoop]: 437 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, 437 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:05,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 437 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:05,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-09 23:10:05,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-11-09 23:10:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 233 states have (on average 1.51931330472103) internal successors, (354), 234 states have internal predecessors, (354), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-09 23:10:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 429 transitions. [2024-11-09 23:10:05,629 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 429 transitions. Word has length 87 [2024-11-09 23:10:05,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:05,631 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 429 transitions. [2024-11-09 23:10:05,631 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:05,631 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 429 transitions. [2024-11-09 23:10:05,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 23:10:05,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:05,637 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:05,657 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:05,837 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:05,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:05,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:05,839 INFO L85 PathProgramCache]: Analyzing trace with hash 589129823, now seen corresponding path program 1 times [2024-11-09 23:10:05,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:05,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417426137] [2024-11-09 23:10:05,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:05,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:06,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:06,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:06,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:06,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:10:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:06,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:10:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:06,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:10:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:06,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 23:10:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:06,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 23:10:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:06,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 23:10:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:06,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 23:10:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:06,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 23:10:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:06,194 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:06,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:06,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417426137] [2024-11-09 23:10:06,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417426137] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:10:06,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122781477] [2024-11-09 23:10:06,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:06,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:10:06,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:10:06,198 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:06,200 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:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:06,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 23:10:06,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:10:06,508 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:06,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:10:06,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122781477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:06,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:10:06,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-09 23:10:06,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726391821] [2024-11-09 23:10:06,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:06,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:10:06,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:06,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:10:06,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:10:06,515 INFO L87 Difference]: Start difference. First operand 288 states and 429 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:06,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:06,571 INFO L93 Difference]: Finished difference Result 416 states and 607 transitions. [2024-11-09 23:10:06,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:10:06,571 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:06,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:06,579 INFO L225 Difference]: With dead ends: 416 [2024-11-09 23:10:06,579 INFO L226 Difference]: Without dead ends: 291 [2024-11-09 23:10:06,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:10:06,586 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 0 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 854 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:06,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 854 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:06,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-09 23:10:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2024-11-09 23:10:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 236 states have (on average 1.5127118644067796) internal successors, (357), 237 states have internal predecessors, (357), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-09 23:10:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 432 transitions. [2024-11-09 23:10:06,615 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 432 transitions. Word has length 89 [2024-11-09 23:10:06,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:06,616 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 432 transitions. [2024-11-09 23:10:06,616 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:06,616 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 432 transitions. [2024-11-09 23:10:06,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 23:10:06,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:06,620 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:06,634 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:06,820 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:06,821 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:06,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:06,821 INFO L85 PathProgramCache]: Analyzing trace with hash -911305121, now seen corresponding path program 1 times [2024-11-09 23:10:06,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:06,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011380276] [2024-11-09 23:10:06,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:06,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:07,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:07,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:07,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:07,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:10:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:07,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:10:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:07,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:10:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:07,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 23:10:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:07,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 23:10:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:07,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 23:10:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:07,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 23:10:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:07,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 23:10:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:07,150 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:07,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:07,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011380276] [2024-11-09 23:10:07,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011380276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:10:07,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3340266] [2024-11-09 23:10:07,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:07,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:10:07,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:10:07,155 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:07,157 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:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:07,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 23:10:07,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:10:07,487 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:07,487 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:10:07,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3340266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:07,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:10:07,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-09 23:10:07,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585114381] [2024-11-09 23:10:07,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:07,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:10:07,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:07,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:10:07,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:10:07,493 INFO L87 Difference]: Start difference. First operand 291 states and 432 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:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:07,534 INFO L93 Difference]: Finished difference Result 621 states and 932 transitions. [2024-11-09 23:10:07,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:10:07,535 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:07,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:07,538 INFO L225 Difference]: With dead ends: 621 [2024-11-09 23:10:07,538 INFO L226 Difference]: Without dead ends: 358 [2024-11-09 23:10:07,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:10:07,541 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 117 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 826 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:07,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 826 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:07,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-09 23:10:07,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 350. [2024-11-09 23:10:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 284 states have (on average 1.5105633802816902) internal successors, (429), 285 states have internal predecessors, (429), 49 states have call successors, (49), 16 states have call predecessors, (49), 16 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-09 23:10:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 526 transitions. [2024-11-09 23:10:07,564 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 526 transitions. Word has length 99 [2024-11-09 23:10:07,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:07,565 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 526 transitions. [2024-11-09 23:10:07,565 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:07,565 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 526 transitions. [2024-11-09 23:10:07,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 23:10:07,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:07,570 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:07,586 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:07,770 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:07,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:07,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:07,771 INFO L85 PathProgramCache]: Analyzing trace with hash -416026883, now seen corresponding path program 1 times [2024-11-09 23:10:07,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:07,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311551996] [2024-11-09 23:10:07,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:07,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:07,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:07,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:07,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:07,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:10:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:07,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:10:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:08,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:10:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:08,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 23:10:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:08,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 23:10:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:08,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 23:10:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:08,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 23:10:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:08,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 23:10:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:08,045 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:08,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:08,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311551996] [2024-11-09 23:10:08,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311551996] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:10:08,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906780994] [2024-11-09 23:10:08,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:08,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:10:08,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:10:08,048 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:08,050 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:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:08,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:10:08,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:10:08,398 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:08,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:10:08,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906780994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:08,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:10:08,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-09 23:10:08,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397490276] [2024-11-09 23:10:08,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:08,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:10:08,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:08,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:10:08,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:10:08,400 INFO L87 Difference]: Start difference. First operand 350 states and 526 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:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:08,475 INFO L93 Difference]: Finished difference Result 691 states and 1042 transitions. [2024-11-09 23:10:08,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:10:08,476 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:08,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:08,481 INFO L225 Difference]: With dead ends: 691 [2024-11-09 23:10:08,481 INFO L226 Difference]: Without dead ends: 352 [2024-11-09 23:10:08,483 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:08,484 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 2 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1673 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:08,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1673 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:08,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-09 23:10:08,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2024-11-09 23:10:08,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 285 states have (on average 1.5087719298245614) internal successors, (430), 287 states have internal predecessors, (430), 49 states have call successors, (49), 16 states have call predecessors, (49), 17 states have return successors, (50), 48 states have call predecessors, (50), 48 states have call successors, (50) [2024-11-09 23:10:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 529 transitions. [2024-11-09 23:10:08,511 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 529 transitions. Word has length 100 [2024-11-09 23:10:08,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:08,513 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 529 transitions. [2024-11-09 23:10:08,513 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:08,513 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 529 transitions. [2024-11-09 23:10:08,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 23:10:08,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:08,515 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:08,531 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:08,715 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:08,716 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:08,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:08,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1696503965, now seen corresponding path program 1 times [2024-11-09 23:10:08,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:08,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517770097] [2024-11-09 23:10:08,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:08,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:08,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:08,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:08,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:08,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:08,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 23:10:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:08,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:10:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:08,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 23:10:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:08,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 23:10:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:08,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 23:10:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:08,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:10:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:09,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 23:10:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:09,003 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:09,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:09,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517770097] [2024-11-09 23:10:09,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517770097] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:10:09,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687894613] [2024-11-09 23:10:09,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:09,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:10:09,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:10:09,006 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:09,008 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:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:09,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 23:10:09,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:10:09,342 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:09,342 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:10:09,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687894613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:09,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:10:09,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-09 23:10:09,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983656779] [2024-11-09 23:10:09,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:09,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:10:09,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:09,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:10:09,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-09 23:10:09,345 INFO L87 Difference]: Start difference. First operand 352 states and 529 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:09,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:09,417 INFO L93 Difference]: Finished difference Result 693 states and 1047 transitions. [2024-11-09 23:10:09,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:10:09,418 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:09,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:09,421 INFO L225 Difference]: With dead ends: 693 [2024-11-09 23:10:09,421 INFO L226 Difference]: Without dead ends: 354 [2024-11-09 23:10:09,423 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:09,424 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 2 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1659 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:09,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1659 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:09,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-09 23:10:09,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-11-09 23:10:09,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 286 states have (on average 1.506993006993007) internal successors, (431), 289 states have internal predecessors, (431), 49 states have call successors, (49), 16 states have call predecessors, (49), 18 states have return successors, (55), 48 states have call predecessors, (55), 48 states have call successors, (55) [2024-11-09 23:10:09,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 535 transitions. [2024-11-09 23:10:09,452 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 535 transitions. Word has length 101 [2024-11-09 23:10:09,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:09,452 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 535 transitions. [2024-11-09 23:10:09,453 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:09,453 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 535 transitions. [2024-11-09 23:10:09,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 23:10:09,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:09,455 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:09,473 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:09,655 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:09,656 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:09,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:09,656 INFO L85 PathProgramCache]: Analyzing trace with hash -121270423, now seen corresponding path program 1 times [2024-11-09 23:10:09,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:09,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881633524] [2024-11-09 23:10:09,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:09,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:09,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:09,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:09,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:09,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:09,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:09,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:10:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:09,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 23:10:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:09,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 23:10:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:09,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 23:10:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:09,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 23:10:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:09,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 23:10:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:09,874 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:09,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:09,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881633524] [2024-11-09 23:10:09,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881633524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:09,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:09,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 23:10:09,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687362312] [2024-11-09 23:10:09,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:09,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:10:09,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:09,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:10:09,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:10:09,877 INFO L87 Difference]: Start difference. First operand 354 states and 535 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:11,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:11,591 INFO L93 Difference]: Finished difference Result 787 states and 1197 transitions. [2024-11-09 23:10:11,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 23:10:11,592 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:11,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:11,596 INFO L225 Difference]: With dead ends: 787 [2024-11-09 23:10:11,597 INFO L226 Difference]: Without dead ends: 456 [2024-11-09 23:10:11,598 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:11,600 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 886 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1873 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 2088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:11,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 1188 Invalid, 2088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1873 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 23:10:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-09 23:10:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 354. [2024-11-09 23:10:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 286 states have (on average 1.506993006993007) internal successors, (431), 289 states have internal predecessors, (431), 49 states have call successors, (49), 16 states have call predecessors, (49), 18 states have return successors, (54), 48 states have call predecessors, (54), 48 states have call successors, (54) [2024-11-09 23:10:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 534 transitions. [2024-11-09 23:10:11,637 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 534 transitions. Word has length 102 [2024-11-09 23:10:11,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:11,638 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 534 transitions. [2024-11-09 23:10:11,638 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:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 534 transitions. [2024-11-09 23:10:11,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 23:10:11,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:11,640 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:11,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:10:11,641 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:11,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:11,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1505932761, now seen corresponding path program 2 times [2024-11-09 23:10:11,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:11,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569709713] [2024-11-09 23:10:11,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:11,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:11,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:11,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:11,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:11,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:11,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:11,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 23:10:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:11,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 23:10:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:11,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 23:10:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:11,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 23:10:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:11,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 23:10:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:11,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 23:10:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:11,857 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:11,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:11,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569709713] [2024-11-09 23:10:11,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569709713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:11,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:11,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 23:10:11,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314210909] [2024-11-09 23:10:11,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:11,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:10:11,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:11,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:10:11,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:10:11,860 INFO L87 Difference]: Start difference. First operand 354 states and 534 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:13,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:13,429 INFO L93 Difference]: Finished difference Result 789 states and 1200 transitions. [2024-11-09 23:10:13,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 23:10:13,430 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:13,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:13,433 INFO L225 Difference]: With dead ends: 789 [2024-11-09 23:10:13,433 INFO L226 Difference]: Without dead ends: 458 [2024-11-09 23:10:13,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:10:13,435 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 882 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1890 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 2105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:13,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 1188 Invalid, 2105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1890 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 23:10:13,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-09 23:10:13,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 356. [2024-11-09 23:10:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 287 states have (on average 1.505226480836237) internal successors, (432), 291 states have internal predecessors, (432), 49 states have call successors, (49), 16 states have call predecessors, (49), 19 states have return successors, (56), 48 states have call predecessors, (56), 48 states have call successors, (56) [2024-11-09 23:10:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 537 transitions. [2024-11-09 23:10:13,467 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 537 transitions. Word has length 103 [2024-11-09 23:10:13,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:13,469 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 537 transitions. [2024-11-09 23:10:13,469 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:13,469 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 537 transitions. [2024-11-09 23:10:13,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 23:10:13,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:13,472 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:13,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:10:13,472 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:13,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:13,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1636287622, now seen corresponding path program 1 times [2024-11-09 23:10:13,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:13,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625097342] [2024-11-09 23:10:13,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:13,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:13,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:13,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:13,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:13,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:13,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:13,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:13,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 23:10:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:13,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 23:10:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:13,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 23:10:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:13,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 23:10:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:13,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 23:10:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:13,724 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:13,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:13,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625097342] [2024-11-09 23:10:13,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625097342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:13,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:13,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 23:10:13,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373010270] [2024-11-09 23:10:13,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:13,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 23:10:13,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:13,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 23:10:13,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:10:13,728 INFO L87 Difference]: Start difference. First operand 356 states and 537 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:15,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:15,794 INFO L93 Difference]: Finished difference Result 787 states and 1195 transitions. [2024-11-09 23:10:15,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:10:15,795 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:15,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:15,798 INFO L225 Difference]: With dead ends: 787 [2024-11-09 23:10:15,798 INFO L226 Difference]: Without dead ends: 458 [2024-11-09 23:10:15,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:10:15,800 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 886 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 3140 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 3361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 3140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:15,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 1645 Invalid, 3361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 3140 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 23:10:15,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-09 23:10:15,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 356. [2024-11-09 23:10:15,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 287 states have (on average 1.505226480836237) internal successors, (432), 291 states have internal predecessors, (432), 49 states have call successors, (49), 16 states have call predecessors, (49), 19 states have return successors, (55), 48 states have call predecessors, (55), 48 states have call successors, (55) [2024-11-09 23:10:15,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 536 transitions. [2024-11-09 23:10:15,824 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 536 transitions. Word has length 104 [2024-11-09 23:10:15,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:15,825 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 536 transitions. [2024-11-09 23:10:15,825 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:15,825 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 536 transitions. [2024-11-09 23:10:15,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 23:10:15,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:15,827 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:15,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:10:15,827 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:15,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:15,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1290430290, now seen corresponding path program 2 times [2024-11-09 23:10:15,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:15,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133654862] [2024-11-09 23:10:15,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:15,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:15,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:15,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:15,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:15,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:15,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:15,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:16,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 23:10:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:16,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 23:10:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:16,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 23:10:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:16,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 23:10:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:16,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 23:10:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:16,046 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:16,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:16,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133654862] [2024-11-09 23:10:16,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133654862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:16,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:16,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 23:10:16,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743522223] [2024-11-09 23:10:16,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:16,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 23:10:16,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:16,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 23:10:16,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:10:16,048 INFO L87 Difference]: Start difference. First operand 356 states and 536 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:18,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:18,148 INFO L93 Difference]: Finished difference Result 789 states and 1201 transitions. [2024-11-09 23:10:18,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:10:18,149 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:18,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:18,152 INFO L225 Difference]: With dead ends: 789 [2024-11-09 23:10:18,152 INFO L226 Difference]: Without dead ends: 460 [2024-11-09 23:10:18,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:10:18,155 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 882 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 3168 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 3386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 3168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:18,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 1646 Invalid, 3386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 3168 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 23:10:18,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-09 23:10:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 358. [2024-11-09 23:10:18,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 288 states have (on average 1.5034722222222223) internal successors, (433), 293 states have internal predecessors, (433), 49 states have call successors, (49), 16 states have call predecessors, (49), 20 states have return successors, (60), 48 states have call predecessors, (60), 48 states have call successors, (60) [2024-11-09 23:10:18,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 542 transitions. [2024-11-09 23:10:18,179 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 542 transitions. Word has length 105 [2024-11-09 23:10:18,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:18,180 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 542 transitions. [2024-11-09 23:10:18,180 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:18,180 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 542 transitions. [2024-11-09 23:10:18,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 23:10:18,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:18,182 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:18,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:10:18,182 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:18,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:18,183 INFO L85 PathProgramCache]: Analyzing trace with hash 2063303971, now seen corresponding path program 1 times [2024-11-09 23:10:18,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:18,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147373668] [2024-11-09 23:10:18,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:18,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:18,389 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 32 [2024-11-09 23:10:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:18,401 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 66 [2024-11-09 23:10:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 23:10:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 23:10:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 23:10:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 23:10:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,444 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:18,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:18,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147373668] [2024-11-09 23:10:18,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147373668] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:10:18,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444951057] [2024-11-09 23:10:18,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:18,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:10:18,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:10:18,446 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:18,449 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:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:18,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 23:10:18,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:10:18,779 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:18,779 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:10:18,865 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:18,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444951057] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:10:18,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:10:18,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-11-09 23:10:18,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968409588] [2024-11-09 23:10:18,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:10:18,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 23:10:18,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:18,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 23:10:18,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-09 23:10:18,868 INFO L87 Difference]: Start difference. First operand 358 states and 542 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:21,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:21,311 INFO L93 Difference]: Finished difference Result 1189 states and 1883 transitions. [2024-11-09 23:10:21,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 23:10:21,311 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:21,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:21,317 INFO L225 Difference]: With dead ends: 1189 [2024-11-09 23:10:21,317 INFO L226 Difference]: Without dead ends: 863 [2024-11-09 23:10:21,320 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:21,320 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 1828 mSDsluCounter, 1859 mSDsCounter, 0 mSdLazyCounter, 3930 mSolverCounterSat, 510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1845 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 4440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 510 IncrementalHoareTripleChecker+Valid, 3930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:21,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1845 Valid, 2041 Invalid, 4440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [510 Valid, 3930 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 23:10:21,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-11-09 23:10:21,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 737. [2024-11-09 23:10:21,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 603 states have (on average 1.5174129353233832) internal successors, (915), 608 states have internal predecessors, (915), 113 states have call successors, (113), 16 states have call predecessors, (113), 20 states have return successors, (134), 112 states have call predecessors, (134), 112 states have call successors, (134) [2024-11-09 23:10:21,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1162 transitions. [2024-11-09 23:10:21,365 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1162 transitions. Word has length 106 [2024-11-09 23:10:21,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:21,366 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1162 transitions. [2024-11-09 23:10:21,366 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:21,366 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1162 transitions. [2024-11-09 23:10:21,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 23:10:21,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:21,370 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:21,390 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:21,571 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:21,572 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:21,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:21,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1914643011, now seen corresponding path program 1 times [2024-11-09 23:10:21,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:21,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141996289] [2024-11-09 23:10:21,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:21,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 23:10:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 23:10:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 23:10:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 23:10:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 23:10:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:21,746 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:21,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:21,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141996289] [2024-11-09 23:10:21,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141996289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:21,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:21,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:10:21,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980551034] [2024-11-09 23:10:21,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:21,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:10:21,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:21,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:10:21,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:10:21,748 INFO L87 Difference]: Start difference. First operand 737 states and 1162 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:22,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:22,937 INFO L93 Difference]: Finished difference Result 1856 states and 2984 transitions. [2024-11-09 23:10:22,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:10:22,938 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:22,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:22,945 INFO L225 Difference]: With dead ends: 1856 [2024-11-09 23:10:22,946 INFO L226 Difference]: Without dead ends: 1199 [2024-11-09 23:10:22,948 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:22,949 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 994 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:22,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 904 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 23:10:22,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2024-11-09 23:10:22,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1089. [2024-11-09 23:10:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 891 states have (on average 1.5173961840628507) internal successors, (1352), 896 states have internal predecessors, (1352), 177 states have call successors, (177), 16 states have call predecessors, (177), 20 states have return successors, (208), 176 states have call predecessors, (208), 176 states have call successors, (208) [2024-11-09 23:10:23,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1737 transitions. [2024-11-09 23:10:23,005 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1737 transitions. Word has length 117 [2024-11-09 23:10:23,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:23,006 INFO L471 AbstractCegarLoop]: Abstraction has 1089 states and 1737 transitions. [2024-11-09 23:10:23,006 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:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1737 transitions. [2024-11-09 23:10:23,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 23:10:23,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:23,011 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:23,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:10:23,011 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:23,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:23,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2130598131, now seen corresponding path program 1 times [2024-11-09 23:10:23,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:23,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524596210] [2024-11-09 23:10:23,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:23,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 23:10:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 23:10:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 23:10:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 23:10:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 23:10:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:23,158 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:23,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:23,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524596210] [2024-11-09 23:10:23,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524596210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:23,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:23,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:10:23,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144473932] [2024-11-09 23:10:23,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:23,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:10:23,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:23,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:10:23,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:10:23,161 INFO L87 Difference]: Start difference. First operand 1089 states and 1737 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:24,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:24,374 INFO L93 Difference]: Finished difference Result 2726 states and 4394 transitions. [2024-11-09 23:10:24,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:10:24,375 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:24,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:24,386 INFO L225 Difference]: With dead ends: 2726 [2024-11-09 23:10:24,386 INFO L226 Difference]: Without dead ends: 1776 [2024-11-09 23:10:24,391 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:24,392 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 991 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:24,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 877 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 23:10:24,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2024-11-09 23:10:24,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1666. [2024-11-09 23:10:24,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1373 states have (on average 1.5134741442097597) internal successors, (2078), 1378 states have internal predecessors, (2078), 272 states have call successors, (272), 16 states have call predecessors, (272), 20 states have return successors, (303), 271 states have call predecessors, (303), 271 states have call successors, (303) [2024-11-09 23:10:24,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2653 transitions. [2024-11-09 23:10:24,469 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2653 transitions. Word has length 118 [2024-11-09 23:10:24,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:24,470 INFO L471 AbstractCegarLoop]: Abstraction has 1666 states and 2653 transitions. [2024-11-09 23:10:24,470 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:24,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2653 transitions. [2024-11-09 23:10:24,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 23:10:24,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:24,477 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:24,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:10:24,477 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:24,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:24,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1677337219, now seen corresponding path program 1 times [2024-11-09 23:10:24,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:24,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765601393] [2024-11-09 23:10:24,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:24,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:24,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:24,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:24,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:24,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:24,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:24,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:24,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 23:10:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:24,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 23:10:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:24,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 23:10:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:24,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 23:10:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:24,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 23:10:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:24,631 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:24,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:24,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765601393] [2024-11-09 23:10:24,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765601393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:24,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:24,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:10:24,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987669288] [2024-11-09 23:10:24,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:24,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:10:24,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:24,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:10:24,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:10:24,634 INFO L87 Difference]: Start difference. First operand 1666 states and 2653 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:25,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:25,716 INFO L93 Difference]: Finished difference Result 4035 states and 6519 transitions. [2024-11-09 23:10:25,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:10:25,716 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:25,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:25,733 INFO L225 Difference]: With dead ends: 4035 [2024-11-09 23:10:25,734 INFO L226 Difference]: Without dead ends: 2657 [2024-11-09 23:10:25,741 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:25,742 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 988 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:25,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 865 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 23:10:25,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2657 states. [2024-11-09 23:10:25,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2657 to 2547. [2024-11-09 23:10:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2547 states, 2131 states have (on average 1.5100891600187705) internal successors, (3218), 2136 states have internal predecessors, (3218), 395 states have call successors, (395), 16 states have call predecessors, (395), 20 states have return successors, (442), 394 states have call predecessors, (442), 394 states have call successors, (442) [2024-11-09 23:10:25,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2547 states to 2547 states and 4055 transitions. [2024-11-09 23:10:25,908 INFO L78 Accepts]: Start accepts. Automaton has 2547 states and 4055 transitions. Word has length 119 [2024-11-09 23:10:25,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:25,908 INFO L471 AbstractCegarLoop]: Abstraction has 2547 states and 4055 transitions. [2024-11-09 23:10:25,908 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:25,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2547 states and 4055 transitions. [2024-11-09 23:10:25,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 23:10:25,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:25,916 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:25,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:10:25,916 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:25,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:25,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1919361133, now seen corresponding path program 1 times [2024-11-09 23:10:25,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:25,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980251733] [2024-11-09 23:10:25,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:25,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:25,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:25,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:25,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:25,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:25,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:25,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:26,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 23:10:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:26,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 23:10:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:26,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 23:10:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:26,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 23:10:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:26,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 23:10:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:26,020 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:26,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:26,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980251733] [2024-11-09 23:10:26,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980251733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:26,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:26,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:10:26,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797073104] [2024-11-09 23:10:26,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:26,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:10:26,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:26,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:10:26,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:10:26,022 INFO L87 Difference]: Start difference. First operand 2547 states and 4055 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:27,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:27,192 INFO L93 Difference]: Finished difference Result 6086 states and 9841 transitions. [2024-11-09 23:10:27,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:10:27,193 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:27,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:27,216 INFO L225 Difference]: With dead ends: 6086 [2024-11-09 23:10:27,216 INFO L226 Difference]: Without dead ends: 4072 [2024-11-09 23:10:27,222 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:27,224 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 985 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:27,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 867 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 23:10:27,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4072 states. [2024-11-09 23:10:27,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4072 to 3962. [2024-11-09 23:10:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3367 states have (on average 1.506088506088506) internal successors, (5071), 3372 states have internal predecessors, (5071), 574 states have call successors, (574), 16 states have call predecessors, (574), 20 states have return successors, (647), 573 states have call predecessors, (647), 573 states have call successors, (647) [2024-11-09 23:10:27,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 6292 transitions. [2024-11-09 23:10:27,387 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 6292 transitions. Word has length 120 [2024-11-09 23:10:27,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:27,387 INFO L471 AbstractCegarLoop]: Abstraction has 3962 states and 6292 transitions. [2024-11-09 23:10:27,388 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:27,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 6292 transitions. [2024-11-09 23:10:27,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 23:10:27,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:27,396 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:27,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 23:10:27,396 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:27,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:27,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1223970205, now seen corresponding path program 1 times [2024-11-09 23:10:27,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:27,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044726971] [2024-11-09 23:10:27,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:27,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 23:10:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 23:10:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 23:10:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 23:10:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 23:10:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:27,492 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:27,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:27,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044726971] [2024-11-09 23:10:27,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044726971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:27,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:27,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:10:27,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002950989] [2024-11-09 23:10:27,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:27,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:10:27,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:27,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:10:27,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:10:27,494 INFO L87 Difference]: Start difference. First operand 3962 states and 6292 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:28,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:28,579 INFO L93 Difference]: Finished difference Result 9754 states and 15752 transitions. [2024-11-09 23:10:28,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:10:28,580 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:28,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:28,619 INFO L225 Difference]: With dead ends: 9754 [2024-11-09 23:10:28,620 INFO L226 Difference]: Without dead ends: 6619 [2024-11-09 23:10:28,633 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:28,633 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 982 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:28,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 917 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 23:10:28,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6619 states. [2024-11-09 23:10:28,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6619 to 6509. [2024-11-09 23:10:28,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6509 states, 5538 states have (on average 1.4956663055254604) internal successors, (8283), 5543 states have internal predecessors, (8283), 950 states have call successors, (950), 16 states have call predecessors, (950), 20 states have return successors, (1067), 949 states have call predecessors, (1067), 949 states have call successors, (1067) [2024-11-09 23:10:29,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6509 states to 6509 states and 10300 transitions. [2024-11-09 23:10:29,006 INFO L78 Accepts]: Start accepts. Automaton has 6509 states and 10300 transitions. Word has length 121 [2024-11-09 23:10:29,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:29,006 INFO L471 AbstractCegarLoop]: Abstraction has 6509 states and 10300 transitions. [2024-11-09 23:10:29,007 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:29,007 INFO L276 IsEmpty]: Start isEmpty. Operand 6509 states and 10300 transitions. [2024-11-09 23:10:29,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 23:10:29,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:29,017 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:29,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:10:29,018 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:29,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:29,018 INFO L85 PathProgramCache]: Analyzing trace with hash -115211635, now seen corresponding path program 1 times [2024-11-09 23:10:29,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:29,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353303538] [2024-11-09 23:10:29,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:29,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:29,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:29,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:29,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:29,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:29,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:29,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:29,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 23:10:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:29,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:10:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:29,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 23:10:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:29,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-09 23:10:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:29,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-09 23:10:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:29,113 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:29,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:29,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353303538] [2024-11-09 23:10:29,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353303538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:29,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:29,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:10:29,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063077135] [2024-11-09 23:10:29,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:29,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:10:29,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:29,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:10:29,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:10:29,117 INFO L87 Difference]: Start difference. First operand 6509 states and 10300 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:30,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:30,307 INFO L93 Difference]: Finished difference Result 16262 states and 26139 transitions. [2024-11-09 23:10:30,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:10:30,308 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:30,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:30,368 INFO L225 Difference]: With dead ends: 16262 [2024-11-09 23:10:30,369 INFO L226 Difference]: Without dead ends: 11044 [2024-11-09 23:10:30,389 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:30,390 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 979 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:30,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 872 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 23:10:30,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11044 states. [2024-11-09 23:10:30,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11044 to 10934. [2024-11-09 23:10:30,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10934 states, 9357 states have (on average 1.4889387624238537) internal successors, (13932), 9362 states have internal predecessors, (13932), 1556 states have call successors, (1556), 16 states have call predecessors, (1556), 20 states have return successors, (1751), 1555 states have call predecessors, (1751), 1555 states have call successors, (1751) [2024-11-09 23:10:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10934 states to 10934 states and 17239 transitions. [2024-11-09 23:10:30,878 INFO L78 Accepts]: Start accepts. Automaton has 10934 states and 17239 transitions. Word has length 122 [2024-11-09 23:10:30,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:30,878 INFO L471 AbstractCegarLoop]: Abstraction has 10934 states and 17239 transitions. [2024-11-09 23:10:30,879 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:30,879 INFO L276 IsEmpty]: Start isEmpty. Operand 10934 states and 17239 transitions. [2024-11-09 23:10:30,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 23:10:30,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:30,894 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:30,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 23:10:30,894 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:30,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:30,894 INFO L85 PathProgramCache]: Analyzing trace with hash 832464547, now seen corresponding path program 1 times [2024-11-09 23:10:30,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:30,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144493655] [2024-11-09 23:10:30,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:30,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:30,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:30,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:30,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:30,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:30,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:30,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:30,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 23:10:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:31,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 23:10:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:31,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 23:10:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:31,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 23:10:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:31,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 23:10:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:31,011 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:31,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:31,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144493655] [2024-11-09 23:10:31,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144493655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:31,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:31,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:10:31,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469389229] [2024-11-09 23:10:31,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:31,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:10:31,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:31,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:10:31,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:10:31,013 INFO L87 Difference]: Start difference. First operand 10934 states and 17239 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:32,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:32,458 INFO L93 Difference]: Finished difference Result 28501 states and 45635 transitions. [2024-11-09 23:10:32,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:10:32,459 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:32,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:32,541 INFO L225 Difference]: With dead ends: 28501 [2024-11-09 23:10:32,541 INFO L226 Difference]: Without dead ends: 19396 [2024-11-09 23:10:32,579 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:32,580 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 976 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:32,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 931 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 23:10:32,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19396 states. [2024-11-09 23:10:33,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19396 to 19286. [2024-11-09 23:10:33,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19286 states, 16506 states have (on average 1.4783109172422149) internal successors, (24401), 16511 states have internal predecessors, (24401), 2759 states have call successors, (2759), 16 states have call predecessors, (2759), 20 states have return successors, (3098), 2758 states have call predecessors, (3098), 2758 states have call successors, (3098) [2024-11-09 23:10:33,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19286 states to 19286 states and 30258 transitions. [2024-11-09 23:10:33,318 INFO L78 Accepts]: Start accepts. Automaton has 19286 states and 30258 transitions. Word has length 123 [2024-11-09 23:10:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:33,319 INFO L471 AbstractCegarLoop]: Abstraction has 19286 states and 30258 transitions. [2024-11-09 23:10:33,319 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:33,320 INFO L276 IsEmpty]: Start isEmpty. Operand 19286 states and 30258 transitions. [2024-11-09 23:10:33,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 23:10:33,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:33,337 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:33,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 23:10:33,338 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:33,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:33,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1415962797, now seen corresponding path program 1 times [2024-11-09 23:10:33,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:33,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45481544] [2024-11-09 23:10:33,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:33,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 23:10:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 23:10:33,525 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 104 [2024-11-09 23:10:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 23:10:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 23:10:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:33,532 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,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:33,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45481544] [2024-11-09 23:10:33,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45481544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:33,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:33,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:10:33,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163977215] [2024-11-09 23:10:33,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:33,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:10:33,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:33,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:10:33,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:10:33,534 INFO L87 Difference]: Start difference. First operand 19286 states and 30258 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:35,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:35,157 INFO L93 Difference]: Finished difference Result 51449 states and 82014 transitions. [2024-11-09 23:10:35,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:10:35,158 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:35,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:35,313 INFO L225 Difference]: With dead ends: 51449 [2024-11-09 23:10:35,313 INFO L226 Difference]: Without dead ends: 34748 [2024-11-09 23:10:35,362 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:35,363 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 973 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:35,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 868 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 23:10:35,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34748 states. [2024-11-09 23:10:36,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34748 to 34638. [2024-11-09 23:10:36,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34638 states, 29819 states have (on average 1.4710419531171401) internal successors, (43865), 29824 states have internal predecessors, (43865), 4798 states have call successors, (4798), 16 states have call predecessors, (4798), 20 states have return successors, (5411), 4797 states have call predecessors, (5411), 4797 states have call successors, (5411) [2024-11-09 23:10:36,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34638 states to 34638 states and 54074 transitions. [2024-11-09 23:10:36,885 INFO L78 Accepts]: Start accepts. Automaton has 34638 states and 54074 transitions. Word has length 124 [2024-11-09 23:10:36,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:36,886 INFO L471 AbstractCegarLoop]: Abstraction has 34638 states and 54074 transitions. [2024-11-09 23:10:36,886 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:36,886 INFO L276 IsEmpty]: Start isEmpty. Operand 34638 states and 54074 transitions. [2024-11-09 23:10:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 23:10:36,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:36,906 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:36,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 23:10:36,906 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:36,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:36,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1400265981, now seen corresponding path program 1 times [2024-11-09 23:10:36,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:36,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191807679] [2024-11-09 23:10:36,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:36,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:36,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:36,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:36,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:36,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:36,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:36,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:37,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 23:10:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:37,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 23:10:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:37,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 23:10:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:37,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 23:10:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:37,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 23:10:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:37,019 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,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:37,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191807679] [2024-11-09 23:10:37,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191807679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:37,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:37,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:10:37,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355893097] [2024-11-09 23:10:37,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:37,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:10:37,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:37,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:10:37,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:10:37,023 INFO L87 Difference]: Start difference. First operand 34638 states and 54074 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:39,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:39,722 INFO L93 Difference]: Finished difference Result 95038 states and 150205 transitions. [2024-11-09 23:10:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:10:39,722 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:39,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:39,993 INFO L225 Difference]: With dead ends: 95038 [2024-11-09 23:10:39,993 INFO L226 Difference]: Without dead ends: 63903 [2024-11-09 23:10:40,070 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,071 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 970 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:40,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 877 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 23:10:40,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63903 states. [2024-11-09 23:10:42,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63903 to 63793. [2024-11-09 23:10:42,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63793 states, 55259 states have (on average 1.463001502017771) internal successors, (80844), 55264 states have internal predecessors, (80844), 8513 states have call successors, (8513), 16 states have call predecessors, (8513), 20 states have return successors, (9658), 8512 states have call predecessors, (9658), 8512 states have call successors, (9658) [2024-11-09 23:10:42,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63793 states to 63793 states and 99015 transitions. [2024-11-09 23:10:42,678 INFO L78 Accepts]: Start accepts. Automaton has 63793 states and 99015 transitions. Word has length 125 [2024-11-09 23:10:42,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:42,679 INFO L471 AbstractCegarLoop]: Abstraction has 63793 states and 99015 transitions. [2024-11-09 23:10:42,679 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:42,679 INFO L276 IsEmpty]: Start isEmpty. Operand 63793 states and 99015 transitions. [2024-11-09 23:10:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 23:10:42,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:42,699 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:42,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 23:10:42,699 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:42,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:42,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1782848915, now seen corresponding path program 1 times [2024-11-09 23:10:42,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:42,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348106698] [2024-11-09 23:10:42,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:42,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:42,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:42,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:42,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:42,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:42,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:42,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:42,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 23:10:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:42,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 23:10:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:42,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 23:10:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:42,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 23:10:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:42,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-09 23:10:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:42,801 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:42,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:42,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348106698] [2024-11-09 23:10:42,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348106698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:42,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:42,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:10:42,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540536339] [2024-11-09 23:10:42,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:42,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:10:42,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:42,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:10:42,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:10:42,803 INFO L87 Difference]: Start difference. First operand 63793 states and 99015 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:46,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:46,405 INFO L93 Difference]: Finished difference Result 119902 states and 189228 transitions. [2024-11-09 23:10:46,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:10:46,406 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:46,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:46,985 INFO L225 Difference]: With dead ends: 119902 [2024-11-09 23:10:46,985 INFO L226 Difference]: Without dead ends: 119777 [2024-11-09 23:10:47,040 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,040 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 964 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:47,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 906 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 23:10:47,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119777 states. [2024-11-09 23:10:50,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119777 to 119667. [2024-11-09 23:10:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119667 states, 104334 states have (on average 1.4540418272087718) internal successors, (151706), 104339 states have internal predecessors, (151706), 15312 states have call successors, (15312), 16 states have call predecessors, (15312), 20 states have return successors, (17503), 15311 states have call predecessors, (17503), 15311 states have call successors, (17503) [2024-11-09 23:10:51,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119667 states to 119667 states and 184521 transitions. [2024-11-09 23:10:51,197 INFO L78 Accepts]: Start accepts. Automaton has 119667 states and 184521 transitions. Word has length 126 [2024-11-09 23:10:51,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:51,198 INFO L471 AbstractCegarLoop]: Abstraction has 119667 states and 184521 transitions. [2024-11-09 23:10:51,198 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:10:51,198 INFO L276 IsEmpty]: Start isEmpty. Operand 119667 states and 184521 transitions. [2024-11-09 23:10:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 23:10:51,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:10:51,219 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:10:51,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 23:10:51,219 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:10:51,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:10:51,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1885662365, now seen corresponding path program 1 times [2024-11-09 23:10:51,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:10:51,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721417399] [2024-11-09 23:10:51,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:10:51,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:10:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:51,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:10:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:51,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:10:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:51,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:10:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:51,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:10:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:51,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:10:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:51,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:10:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:51,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:10:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:51,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 23:10:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:51,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 23:10:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:51,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 23:10:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:51,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 23:10:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:10:51,823 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:51,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:10:51,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721417399] [2024-11-09 23:10:51,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721417399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:10:51,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:10:51,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 23:10:51,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144655337] [2024-11-09 23:10:51,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:10:51,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:10:51,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:10:51,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:10:51,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:10:51,829 INFO L87 Difference]: Start difference. First operand 119667 states and 184521 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:10:55,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:10:55,099 INFO L93 Difference]: Finished difference Result 119766 states and 187948 transitions. [2024-11-09 23:10:55,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 23:10:55,100 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:10:55,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:10:55,124 INFO L225 Difference]: With dead ends: 119766 [2024-11-09 23:10:55,124 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 23:10:55,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2024-11-09 23:10:55,256 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 869 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 1853 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 2064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:10:55,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 1189 Invalid, 2064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1853 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 23:10:55,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 23:10:55,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 23:10:55,257 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:10:55,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 23:10:55,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2024-11-09 23:10:55,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:10:55,280 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 23:10:55,280 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:10:55,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 23:10:55,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 23:10:55,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 23:10:55,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 23:10:55,285 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:10:55,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 23:11:11,003 WARN L286 SmtUtils]: Spent 13.93s on a formula simplification that was a NOOP. DAG size: 1126 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)