./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product31.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_spec8_product31.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa31ba7b6b6c5a20100c4ed7bd6bb53a6560ae9fc8557479e094a44cc1bad058 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:12:24,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:12:24,370 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:12:24,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:12:24,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:12:24,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:12:24,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:12:24,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:12:24,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:12:24,406 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:12:24,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:12:24,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:12:24,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:12:24,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:12:24,410 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:12:24,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:12:24,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:12:24,411 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:12:24,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:12:24,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:12:24,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:12:24,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:12:24,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:12:24,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:12:24,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:12:24,417 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:12:24,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:12:24,417 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:12:24,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:12:24,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:12:24,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:12:24,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:12:24,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:12:24,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:12:24,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:12:24,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:12:24,419 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:12:24,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:12:24,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:12:24,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:12:24,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:12:24,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:12:24,420 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 -> aa31ba7b6b6c5a20100c4ed7bd6bb53a6560ae9fc8557479e094a44cc1bad058 [2024-11-09 23:12:24,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:12:24,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:12:24,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:12:24,715 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:12:24,715 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:12:24,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product31.cil.c [2024-11-09 23:12:26,196 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:12:26,507 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:12:26,508 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product31.cil.c [2024-11-09 23:12:26,527 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e93b735/3838b56ed42f486a855a33004b69180d/FLAGfcedac900 [2024-11-09 23:12:26,780 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72e93b735/3838b56ed42f486a855a33004b69180d [2024-11-09 23:12:26,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:12:26,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:12:26,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:12:26,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:12:26,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:12:26,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:12:26" (1/1) ... [2024-11-09 23:12:26,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fe3d6a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:26, skipping insertion in model container [2024-11-09 23:12:26,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:12:26" (1/1) ... [2024-11-09 23:12:26,854 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:12:27,334 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_spec8_product31.cil.c[36672,36685] [2024-11-09 23:12:27,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:12:27,524 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:12:27,532 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [48] [2024-11-09 23:12:27,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1128] [2024-11-09 23:12:27,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1494] [2024-11-09 23:12:27,534 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1503] [2024-11-09 23:12:27,535 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1521] [2024-11-09 23:12:27,537 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1680] [2024-11-09 23:12:27,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2082] [2024-11-09 23:12:27,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2120] [2024-11-09 23:12:27,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2484] [2024-11-09 23:12:27,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2769] [2024-11-09 23:12:27,539 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [2985] [2024-11-09 23:12:27,576 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_spec8_product31.cil.c[36672,36685] [2024-11-09 23:12:27,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:12:27,655 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:12:27,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:27 WrapperNode [2024-11-09 23:12:27,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:12:27,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:12:27,657 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:12:27,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:12:27,664 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:12:27" (1/1) ... [2024-11-09 23:12:27,693 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:12:27" (1/1) ... [2024-11-09 23:12:27,754 INFO L138 Inliner]: procedures = 132, calls = 207, calls flagged for inlining = 62, calls inlined = 57, statements flattened = 1042 [2024-11-09 23:12:27,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:12:27,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:12:27,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:12:27,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:12:27,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:27" (1/1) ... [2024-11-09 23:12:27,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:27" (1/1) ... [2024-11-09 23:12:27,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:27" (1/1) ... [2024-11-09 23:12:27,823 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:12:27,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:27" (1/1) ... [2024-11-09 23:12:27,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:27" (1/1) ... [2024-11-09 23:12:27,843 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:27" (1/1) ... [2024-11-09 23:12:27,849 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:27" (1/1) ... [2024-11-09 23:12:27,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:27" (1/1) ... [2024-11-09 23:12:27,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:27" (1/1) ... [2024-11-09 23:12:27,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:12:27,877 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:12:27,877 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:12:27,877 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:12:27,879 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:27" (1/1) ... [2024-11-09 23:12:27,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:12:27,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:12:27,913 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:12:27,919 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:12:27,961 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-11-09 23:12:27,961 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-11-09 23:12:27,961 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-11-09 23:12:27,961 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-11-09 23:12:27,961 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-11-09 23:12:27,961 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-11-09 23:12:27,961 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-09 23:12:27,961 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-09 23:12:27,961 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-09 23:12:27,961 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-09 23:12:27,961 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-09 23:12:27,962 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-09 23:12:27,962 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-09 23:12:27,962 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-09 23:12:27,962 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-11-09 23:12:27,962 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-11-09 23:12:27,962 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-09 23:12:27,962 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-09 23:12:27,962 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-09 23:12:27,962 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-09 23:12:27,962 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-09 23:12:27,962 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-09 23:12:27,962 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-09 23:12:27,963 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-09 23:12:27,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:12:27,963 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-09 23:12:27,963 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-09 23:12:27,963 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-11-09 23:12:27,963 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-11-09 23:12:27,964 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-09 23:12:27,964 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-09 23:12:27,964 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-09 23:12:27,965 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-09 23:12:27,965 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-09 23:12:27,965 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-09 23:12:27,965 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-11-09 23:12:27,965 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-11-09 23:12:27,965 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-09 23:12:27,965 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-09 23:12:27,965 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-11-09 23:12:27,966 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-11-09 23:12:27,966 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-09 23:12:27,966 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-09 23:12:27,966 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-09 23:12:27,966 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-09 23:12:27,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:12:27,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 23:12:27,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 23:12:27,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 23:12:27,967 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-09 23:12:27,967 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-09 23:12:27,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:12:27,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:12:28,159 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:12:28,162 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:12:28,509 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1105-1: getClientId_#res#1 := getClientId_~retValue_acc~16#1; [2024-11-09 23:12:28,509 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2063-1: isVerified_#res#1 := isVerified_~retValue_acc~35#1; [2024-11-09 23:12:28,510 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1726-1: getEmailId_#res#1 := getEmailId_~retValue_acc~26#1; [2024-11-09 23:12:28,510 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1058-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~15#1; [2024-11-09 23:12:28,520 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989: #res := ~retValue_acc~33; [2024-11-09 23:12:28,533 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2390: #res := ~retValue_acc~42; [2024-11-09 23:12:28,562 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L762: #res#1 := ~retValue_acc~11#1; [2024-11-09 23:12:28,562 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~10#1; [2024-11-09 23:12:28,593 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L986: #res := ~retValue_acc~14; [2024-11-09 23:12:28,608 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L670: #res := ~retValue_acc~9; [2024-11-09 23:12:28,617 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1677-1: createEmail_#res#1 := createEmail_~retValue_acc~24#1; [2024-11-09 23:12:28,632 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915: #res := ~retValue_acc~31; [2024-11-09 23:12:28,646 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1952: #res := ~retValue_acc~32; [2024-11-09 23:12:28,652 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2026: #res := ~retValue_acc~34; [2024-11-09 23:12:28,679 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1800: #res := ~retValue_acc~28; [2024-11-09 23:12:28,973 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2356-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~40#1; [2024-11-09 23:12:28,973 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2117-1: valid_product_#res#1 := valid_product_~retValue_acc~37#1; [2024-11-09 23:12:28,973 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2365-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~41#1; [2024-11-09 23:12:28,973 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L932-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~13#1; [2024-11-09 23:12:28,973 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L825-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~12#1; [2024-11-09 23:12:28,974 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2347-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~39#1; [2024-11-09 23:12:28,982 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1763: #res := ~retValue_acc~27; [2024-11-09 23:12:28,990 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1633-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~21#1; [2024-11-09 23:12:28,990 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: #res#1 := ~retValue_acc~22#1; [2024-11-09 23:12:29,141 INFO L? ?]: Removed 482 outVars from TransFormulas that were not future-live. [2024-11-09 23:12:29,141 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:12:29,165 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:12:29,165 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:12:29,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:12:29 BoogieIcfgContainer [2024-11-09 23:12:29,169 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:12:29,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:12:29,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:12:29,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:12:29,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:12:26" (1/3) ... [2024-11-09 23:12:29,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f95f19c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:12:29, skipping insertion in model container [2024-11-09 23:12:29,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:27" (2/3) ... [2024-11-09 23:12:29,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f95f19c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:12:29, skipping insertion in model container [2024-11-09 23:12:29,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:12:29" (3/3) ... [2024-11-09 23:12:29,177 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec8_product31.cil.c [2024-11-09 23:12:29,193 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:12:29,194 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:12:29,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:12:29,275 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;@4fd3d1a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:12:29,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:12:29,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 382 states, 298 states have (on average 1.483221476510067) internal successors, (442), 302 states have internal predecessors, (442), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2024-11-09 23:12:29,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 23:12:29,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:29,307 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:29,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:29,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:29,314 INFO L85 PathProgramCache]: Analyzing trace with hash -625446825, now seen corresponding path program 1 times [2024-11-09 23:12:29,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:29,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796600043] [2024-11-09 23:12:29,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:29,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:29,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:29,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:29,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:30,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:12:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:30,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:12:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:30,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:12:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:30,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 23:12:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:30,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 23:12:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:30,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 23:12:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:30,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 23:12:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:30,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 23:12:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:30,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 23:12:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:30,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 23:12:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:30,122 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:12:30,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:30,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796600043] [2024-11-09 23:12:30,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796600043] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:12:30,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732226440] [2024-11-09 23:12:30,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:30,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:12:30,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:12:30,128 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:12:30,133 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:12:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:30,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 23:12:30,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:12:30,527 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:12:30,527 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:12:30,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732226440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:30,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:12:30,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-09 23:12:30,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641941774] [2024-11-09 23:12:30,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:30,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:12:30,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:30,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:12:30,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:12:30,568 INFO L87 Difference]: Start difference. First operand has 382 states, 298 states have (on average 1.483221476510067) internal successors, (442), 302 states have internal predecessors, (442), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:12:30,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:30,633 INFO L93 Difference]: Finished difference Result 599 states and 863 transitions. [2024-11-09 23:12:30,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:12:30,636 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 102 [2024-11-09 23:12:30,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:30,651 INFO L225 Difference]: With dead ends: 599 [2024-11-09 23:12:30,651 INFO L226 Difference]: Without dead ends: 374 [2024-11-09 23:12:30,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:12:30,660 INFO L432 NwaCegarLoop]: 555 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:30,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:12:30,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-09 23:12:30,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2024-11-09 23:12:30,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 291 states have (on average 1.47766323024055) internal successors, (430), 294 states have internal predecessors, (430), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-09 23:12:30,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 547 transitions. [2024-11-09 23:12:30,731 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 547 transitions. Word has length 102 [2024-11-09 23:12:30,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:30,733 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 547 transitions. [2024-11-09 23:12:30,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:12:30,734 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 547 transitions. [2024-11-09 23:12:30,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 23:12:30,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:30,740 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:30,756 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:12:30,940 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:12:30,941 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:30,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:30,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1997365873, now seen corresponding path program 1 times [2024-11-09 23:12:30,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:30,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819835566] [2024-11-09 23:12:30,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:30,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:31,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:31,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:31,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:31,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:12:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:31,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:12:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:31,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:12:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:31,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 23:12:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:31,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 23:12:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:31,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 23:12:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:31,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 23:12:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:31,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 23:12:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:31,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 23:12:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:31,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 23:12:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:31,266 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:12:31,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:31,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819835566] [2024-11-09 23:12:31,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819835566] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:12:31,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875181979] [2024-11-09 23:12:31,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:31,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:12:31,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:12:31,271 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:12:31,272 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:12:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:31,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 23:12:31,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:12:31,630 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:12:31,630 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:12:31,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875181979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:31,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:12:31,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-09 23:12:31,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275804844] [2024-11-09 23:12:31,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:31,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:12:31,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:31,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:12:31,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:12:31,632 INFO L87 Difference]: Start difference. First operand 374 states and 547 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:12:31,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:31,664 INFO L93 Difference]: Finished difference Result 588 states and 843 transitions. [2024-11-09 23:12:31,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:12:31,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2024-11-09 23:12:31,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:31,668 INFO L225 Difference]: With dead ends: 588 [2024-11-09 23:12:31,668 INFO L226 Difference]: Without dead ends: 377 [2024-11-09 23:12:31,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 125 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:12:31,674 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 0 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:31,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1090 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:12:31,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-09 23:12:31,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2024-11-09 23:12:31,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 294 states have (on average 1.4727891156462585) internal successors, (433), 297 states have internal predecessors, (433), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-09 23:12:31,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 550 transitions. [2024-11-09 23:12:31,716 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 550 transitions. Word has length 104 [2024-11-09 23:12:31,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:31,717 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 550 transitions. [2024-11-09 23:12:31,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:12:31,717 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 550 transitions. [2024-11-09 23:12:31,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 23:12:31,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:31,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:31,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 23:12:31,924 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:12:31,925 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:31,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:31,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1273278865, now seen corresponding path program 1 times [2024-11-09 23:12:31,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:31,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152127115] [2024-11-09 23:12:31,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:31,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:32,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:32,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:32,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:32,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:12:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:32,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:12:32,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:32,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:12:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:32,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 23:12:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:32,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 23:12:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:32,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 23:12:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:32,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 23:12:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:32,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 23:12:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:32,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 23:12:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:32,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 23:12:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:32,171 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:12:32,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:32,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152127115] [2024-11-09 23:12:32,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152127115] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:12:32,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832214756] [2024-11-09 23:12:32,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:32,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:12:32,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:12:32,173 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:12:32,177 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:12:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:32,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 23:12:32,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:12:32,526 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:12:32,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:12:32,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832214756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:32,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:12:32,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-09 23:12:32,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635272513] [2024-11-09 23:12:32,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:32,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:12:32,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:32,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:12:32,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:12:32,530 INFO L87 Difference]: Start difference. First operand 377 states and 550 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:12:32,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:32,570 INFO L93 Difference]: Finished difference Result 793 states and 1168 transitions. [2024-11-09 23:12:32,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:12:32,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2024-11-09 23:12:32,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:32,576 INFO L225 Difference]: With dead ends: 793 [2024-11-09 23:12:32,576 INFO L226 Difference]: Without dead ends: 444 [2024-11-09 23:12:32,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 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:12:32,580 INFO L432 NwaCegarLoop]: 559 mSDtfsCounter, 117 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1059 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:12:32,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1059 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:12:32,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-09 23:12:32,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 436. [2024-11-09 23:12:32,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 342 states have (on average 1.476608187134503) internal successors, (505), 345 states have internal predecessors, (505), 70 states have call successors, (70), 23 states have call predecessors, (70), 23 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-09 23:12:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 644 transitions. [2024-11-09 23:12:32,615 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 644 transitions. Word has length 111 [2024-11-09 23:12:32,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:32,616 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 644 transitions. [2024-11-09 23:12:32,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:12:32,616 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 644 transitions. [2024-11-09 23:12:32,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 23:12:32,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:32,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:32,634 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:12:32,820 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:12:32,821 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:32,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:32,821 INFO L85 PathProgramCache]: Analyzing trace with hash -366847910, now seen corresponding path program 1 times [2024-11-09 23:12:32,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:32,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137112146] [2024-11-09 23:12:32,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:32,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:32,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:32,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:32,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:32,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:12:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:32,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:12:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:32,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:12:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:32,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 23:12:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:33,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 23:12:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:33,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 23:12:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:33,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 23:12:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:33,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 23:12:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:33,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 23:12:33,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:33,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 23:12:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:33,019 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:12:33,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:33,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137112146] [2024-11-09 23:12:33,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137112146] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:12:33,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117212553] [2024-11-09 23:12:33,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:33,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:12:33,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:12:33,021 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:12:33,024 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:12:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:33,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:12:33,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:12:33,408 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:12:33,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:12:33,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117212553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:33,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:12:33,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-09 23:12:33,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327668563] [2024-11-09 23:12:33,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:33,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:12:33,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:33,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:12:33,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:12:33,411 INFO L87 Difference]: Start difference. First operand 436 states and 644 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 23:12:33,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:33,487 INFO L93 Difference]: Finished difference Result 863 states and 1278 transitions. [2024-11-09 23:12:33,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:12:33,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2024-11-09 23:12:33,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:33,491 INFO L225 Difference]: With dead ends: 863 [2024-11-09 23:12:33,494 INFO L226 Difference]: Without dead ends: 438 [2024-11-09 23:12:33,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 131 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:12:33,498 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 2 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2145 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:33,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2145 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:12:33,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-09 23:12:33,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2024-11-09 23:12:33,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 343 states have (on average 1.4752186588921283) internal successors, (506), 347 states have internal predecessors, (506), 70 states have call successors, (70), 23 states have call predecessors, (70), 24 states have return successors, (71), 69 states have call predecessors, (71), 69 states have call successors, (71) [2024-11-09 23:12:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 647 transitions. [2024-11-09 23:12:33,518 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 647 transitions. Word has length 112 [2024-11-09 23:12:33,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:33,519 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 647 transitions. [2024-11-09 23:12:33,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 23:12:33,519 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 647 transitions. [2024-11-09 23:12:33,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 23:12:33,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:33,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:33,541 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:12:33,722 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:12:33,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:33,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:33,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1654081877, now seen corresponding path program 1 times [2024-11-09 23:12:33,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:33,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146111652] [2024-11-09 23:12:33,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:33,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:33,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:33,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:33,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:33,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:33,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 23:12:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:33,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:12:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:33,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 23:12:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:33,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 23:12:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:33,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 23:12:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:33,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 23:12:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:33,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 23:12:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:33,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 23:12:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:33,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 23:12:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:33,953 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:12:33,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:33,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146111652] [2024-11-09 23:12:33,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146111652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:12:33,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157336060] [2024-11-09 23:12:33,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:33,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:12:33,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:12:33,955 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:12:33,957 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:12:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 23:12:34,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:12:34,304 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:12:34,305 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:12:34,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157336060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:34,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:12:34,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-09 23:12:34,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728252065] [2024-11-09 23:12:34,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:34,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:12:34,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:34,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:12:34,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-09 23:12:34,308 INFO L87 Difference]: Start difference. First operand 438 states and 647 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 23:12:34,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:34,413 INFO L93 Difference]: Finished difference Result 865 states and 1283 transitions. [2024-11-09 23:12:34,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:12:34,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 113 [2024-11-09 23:12:34,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:34,417 INFO L225 Difference]: With dead ends: 865 [2024-11-09 23:12:34,418 INFO L226 Difference]: Without dead ends: 440 [2024-11-09 23:12:34,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 131 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:12:34,421 INFO L432 NwaCegarLoop]: 537 mSDtfsCounter, 2 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2131 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:34,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2131 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:12:34,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-09 23:12:34,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2024-11-09 23:12:34,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 344 states have (on average 1.4738372093023255) internal successors, (507), 349 states have internal predecessors, (507), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (76), 69 states have call predecessors, (76), 69 states have call successors, (76) [2024-11-09 23:12:34,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 653 transitions. [2024-11-09 23:12:34,443 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 653 transitions. Word has length 113 [2024-11-09 23:12:34,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:34,443 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 653 transitions. [2024-11-09 23:12:34,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 23:12:34,444 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 653 transitions. [2024-11-09 23:12:34,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 23:12:34,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:34,446 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:34,465 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:12:34,650 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:12:34,651 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:34,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:34,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1202571322, now seen corresponding path program 1 times [2024-11-09 23:12:34,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:34,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766133655] [2024-11-09 23:12:34,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:34,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:12:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 23:12:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 23:12:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 23:12:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 23:12:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:12:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 23:12:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 23:12:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,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:12:34,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:34,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766133655] [2024-11-09 23:12:34,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766133655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:34,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:34,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 23:12:34,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635794385] [2024-11-09 23:12:34,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:34,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:12:34,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:34,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:12:34,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:12:34,878 INFO L87 Difference]: Start difference. First operand 440 states and 653 transitions. Second operand has 9 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 23:12:37,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:37,145 INFO L93 Difference]: Finished difference Result 1044 states and 1551 transitions. [2024-11-09 23:12:37,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 23:12:37,145 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2024-11-09 23:12:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:37,152 INFO L225 Difference]: With dead ends: 1044 [2024-11-09 23:12:37,152 INFO L226 Difference]: Without dead ends: 627 [2024-11-09 23:12:37,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:12:37,156 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1243 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 2711 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 3144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 2711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:37,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 1188 Invalid, 3144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 2711 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 23:12:37,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-09 23:12:37,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 440. [2024-11-09 23:12:37,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 344 states have (on average 1.4738372093023255) internal successors, (507), 349 states have internal predecessors, (507), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (75), 69 states have call predecessors, (75), 69 states have call successors, (75) [2024-11-09 23:12:37,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 652 transitions. [2024-11-09 23:12:37,228 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 652 transitions. Word has length 114 [2024-11-09 23:12:37,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:37,228 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 652 transitions. [2024-11-09 23:12:37,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 23:12:37,229 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 652 transitions. [2024-11-09 23:12:37,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 23:12:37,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:37,232 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:37,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:12:37,234 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:37,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:37,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2072711533, now seen corresponding path program 2 times [2024-11-09 23:12:37,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:37,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337042852] [2024-11-09 23:12:37,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:37,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:37,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:37,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:37,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:37,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:37,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:37,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 23:12:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:37,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 23:12:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:37,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 23:12:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:37,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 23:12:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:37,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 23:12:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:37,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 23:12:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:37,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 23:12:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:37,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 23:12:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:37,438 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:12:37,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:37,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337042852] [2024-11-09 23:12:37,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337042852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:37,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:37,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 23:12:37,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745288387] [2024-11-09 23:12:37,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:37,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:12:37,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:37,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:12:37,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:12:37,440 INFO L87 Difference]: Start difference. First operand 440 states and 652 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 23:12:39,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:39,562 INFO L93 Difference]: Finished difference Result 1046 states and 1554 transitions. [2024-11-09 23:12:39,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 23:12:39,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 115 [2024-11-09 23:12:39,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:39,568 INFO L225 Difference]: With dead ends: 1046 [2024-11-09 23:12:39,568 INFO L226 Difference]: Without dead ends: 629 [2024-11-09 23:12:39,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:12:39,571 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1238 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 2771 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1239 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 3193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 2771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:39,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1239 Valid, 1188 Invalid, 3193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 2771 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 23:12:39,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-09 23:12:39,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 442. [2024-11-09 23:12:39,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 345 states have (on average 1.472463768115942) internal successors, (508), 351 states have internal predecessors, (508), 70 states have call successors, (70), 23 states have call predecessors, (70), 26 states have return successors, (77), 69 states have call predecessors, (77), 69 states have call successors, (77) [2024-11-09 23:12:39,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 655 transitions. [2024-11-09 23:12:39,647 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 655 transitions. Word has length 115 [2024-11-09 23:12:39,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:39,647 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 655 transitions. [2024-11-09 23:12:39,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 23:12:39,648 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 655 transitions. [2024-11-09 23:12:39,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 23:12:39,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:39,650 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:39,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:12:39,650 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:39,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:39,651 INFO L85 PathProgramCache]: Analyzing trace with hash -40678089, now seen corresponding path program 1 times [2024-11-09 23:12:39,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:39,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025469506] [2024-11-09 23:12:39,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:39,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:39,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:39,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:39,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:39,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:39,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:39,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:39,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 23:12:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:39,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 23:12:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:39,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 23:12:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:39,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 23:12:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:39,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 23:12:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:39,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 23:12:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:39,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 23:12:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:39,904 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:12:39,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:39,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025469506] [2024-11-09 23:12:39,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025469506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:39,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:39,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 23:12:39,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206014340] [2024-11-09 23:12:39,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:39,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 23:12:39,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:39,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 23:12:39,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:12:39,907 INFO L87 Difference]: Start difference. First operand 442 states and 655 transitions. Second operand has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-09 23:12:42,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:42,517 INFO L93 Difference]: Finished difference Result 1044 states and 1549 transitions. [2024-11-09 23:12:42,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:12:42,518 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 116 [2024-11-09 23:12:42,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:42,522 INFO L225 Difference]: With dead ends: 1044 [2024-11-09 23:12:42,522 INFO L226 Difference]: Without dead ends: 629 [2024-11-09 23:12:42,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 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:12:42,524 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1218 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 4658 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 5094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 4658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:42,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 1645 Invalid, 5094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 4658 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 23:12:42,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-09 23:12:42,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 442. [2024-11-09 23:12:42,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 345 states have (on average 1.472463768115942) internal successors, (508), 351 states have internal predecessors, (508), 70 states have call successors, (70), 23 states have call predecessors, (70), 26 states have return successors, (76), 69 states have call predecessors, (76), 69 states have call successors, (76) [2024-11-09 23:12:42,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 654 transitions. [2024-11-09 23:12:42,558 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 654 transitions. Word has length 116 [2024-11-09 23:12:42,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:42,559 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 654 transitions. [2024-11-09 23:12:42,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-09 23:12:42,559 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 654 transitions. [2024-11-09 23:12:42,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 23:12:42,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:42,561 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:42,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:12:42,562 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:42,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:42,562 INFO L85 PathProgramCache]: Analyzing trace with hash 378904562, now seen corresponding path program 2 times [2024-11-09 23:12:42,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:42,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581642994] [2024-11-09 23:12:42,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:42,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:42,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:42,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:42,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:42,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:42,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:42,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:42,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 23:12:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:42,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 23:12:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:42,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 23:12:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:42,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 23:12:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:42,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 23:12:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:42,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 23:12:42,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:42,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-09 23:12:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:42,833 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:12:42,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:42,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581642994] [2024-11-09 23:12:42,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581642994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:42,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:42,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 23:12:42,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589741457] [2024-11-09 23:12:42,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:42,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 23:12:42,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:42,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 23:12:42,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:12:42,836 INFO L87 Difference]: Start difference. First operand 442 states and 654 transitions. Second operand has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-09 23:12:45,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:45,144 INFO L93 Difference]: Finished difference Result 1046 states and 1555 transitions. [2024-11-09 23:12:45,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:12:45,144 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 117 [2024-11-09 23:12:45,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:45,149 INFO L225 Difference]: With dead ends: 1046 [2024-11-09 23:12:45,149 INFO L226 Difference]: Without dead ends: 631 [2024-11-09 23:12:45,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:12:45,151 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 1268 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 4505 mSolverCounterSat, 436 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1269 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 4941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 4505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:45,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1269 Valid, 1646 Invalid, 4941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 4505 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 23:12:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-09 23:12:45,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 444. [2024-11-09 23:12:45,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 346 states have (on average 1.4710982658959537) internal successors, (509), 353 states have internal predecessors, (509), 70 states have call successors, (70), 23 states have call predecessors, (70), 27 states have return successors, (81), 69 states have call predecessors, (81), 69 states have call successors, (81) [2024-11-09 23:12:45,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 660 transitions. [2024-11-09 23:12:45,185 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 660 transitions. Word has length 117 [2024-11-09 23:12:45,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:45,185 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 660 transitions. [2024-11-09 23:12:45,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-09 23:12:45,186 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 660 transitions. [2024-11-09 23:12:45,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 23:12:45,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:45,187 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:45,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:12:45,189 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:45,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:45,189 INFO L85 PathProgramCache]: Analyzing trace with hash -789428172, now seen corresponding path program 1 times [2024-11-09 23:12:45,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:45,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903551092] [2024-11-09 23:12:45,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:45,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:45,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:45,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:45,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:45,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:45,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:45,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:45,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 23:12:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:45,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 23:12:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:45,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 23:12:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:45,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 23:12:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:45,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 23:12:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:45,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 23:12:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:45,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 23:12:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:45,353 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:12:45,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:45,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903551092] [2024-11-09 23:12:45,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903551092] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:12:45,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965976773] [2024-11-09 23:12:45,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:45,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:12:45,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:12:45,356 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:12:45,357 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:12:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:45,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 23:12:45,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:12:45,674 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:12:45,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:12:45,774 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:12:45,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965976773] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:12:45,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:12:45,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-11-09 23:12:45,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107269369] [2024-11-09 23:12:45,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:12:45,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 23:12:45,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:45,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 23:12:45,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:12:45,779 INFO L87 Difference]: Start difference. First operand 444 states and 660 transitions. Second operand has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 7 states have internal predecessors, (116), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 23:12:47,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:47,596 INFO L93 Difference]: Finished difference Result 1245 states and 1913 transitions. [2024-11-09 23:12:47,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:12:47,596 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 7 states have internal predecessors, (116), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 118 [2024-11-09 23:12:47,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:47,603 INFO L225 Difference]: With dead ends: 1245 [2024-11-09 23:12:47,603 INFO L226 Difference]: Without dead ends: 1034 [2024-11-09 23:12:47,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:12:47,606 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 1625 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 2893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:47,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1670 Valid, 1409 Invalid, 2893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 23:12:47,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-11-09 23:12:47,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 823. [2024-11-09 23:12:47,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 661 states have (on average 1.5098335854765508) internal successors, (998), 668 states have internal predecessors, (998), 134 states have call successors, (134), 23 states have call predecessors, (134), 27 states have return successors, (155), 133 states have call predecessors, (155), 133 states have call successors, (155) [2024-11-09 23:12:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1287 transitions. [2024-11-09 23:12:47,652 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1287 transitions. Word has length 118 [2024-11-09 23:12:47,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:47,652 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1287 transitions. [2024-11-09 23:12:47,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 7 states have internal predecessors, (116), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-09 23:12:47,653 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1287 transitions. [2024-11-09 23:12:47,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 23:12:47,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:47,657 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:47,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 23:12:47,860 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:12:47,861 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:47,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:47,861 INFO L85 PathProgramCache]: Analyzing trace with hash 714687969, now seen corresponding path program 1 times [2024-11-09 23:12:47,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:47,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670944896] [2024-11-09 23:12:47,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:47,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:47,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:47,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:47,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:47,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:47,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:47,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:47,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 23:12:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:47,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 23:12:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:47,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 23:12:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:47,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 23:12:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:47,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 23:12:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:47,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 23:12:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:47,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 23:12:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:47,981 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:12:47,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:47,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670944896] [2024-11-09 23:12:47,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670944896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:47,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:47,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:12:47,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558865124] [2024-11-09 23:12:47,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:47,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:12:47,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:47,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:12:47,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:12:47,983 INFO L87 Difference]: Start difference. First operand 823 states and 1287 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:12:49,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:49,358 INFO L93 Difference]: Finished difference Result 2148 states and 3406 transitions. [2024-11-09 23:12:49,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:12:49,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 132 [2024-11-09 23:12:49,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:49,369 INFO L225 Difference]: With dead ends: 2148 [2024-11-09 23:12:49,370 INFO L226 Difference]: Without dead ends: 1395 [2024-11-09 23:12:49,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:12:49,374 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 1444 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 1999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:49,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1459 Valid, 933 Invalid, 1999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 1512 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 23:12:49,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2024-11-09 23:12:49,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1200. [2024-11-09 23:12:49,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 974 states have (on average 1.5143737166324436) internal successors, (1475), 981 states have internal predecessors, (1475), 198 states have call successors, (198), 23 states have call predecessors, (198), 27 states have return successors, (229), 197 states have call predecessors, (229), 197 states have call successors, (229) [2024-11-09 23:12:49,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1902 transitions. [2024-11-09 23:12:49,441 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1902 transitions. Word has length 132 [2024-11-09 23:12:49,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:49,441 INFO L471 AbstractCegarLoop]: Abstraction has 1200 states and 1902 transitions. [2024-11-09 23:12:49,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:12:49,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1902 transitions. [2024-11-09 23:12:49,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 23:12:49,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:49,447 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:49,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:12:49,448 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:49,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:49,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1484736450, now seen corresponding path program 1 times [2024-11-09 23:12:49,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:49,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98732880] [2024-11-09 23:12:49,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:49,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:49,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:49,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:49,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:49,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:49,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:49,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:49,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 23:12:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:49,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 23:12:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:49,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 23:12:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:49,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 23:12:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:49,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 23:12:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:49,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 23:12:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:49,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-09 23:12:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:49,570 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:12:49,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:49,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98732880] [2024-11-09 23:12:49,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98732880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:49,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:49,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:12:49,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954418183] [2024-11-09 23:12:49,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:49,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:12:49,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:49,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:12:49,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:12:49,572 INFO L87 Difference]: Start difference. First operand 1200 states and 1902 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:12:50,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:50,897 INFO L93 Difference]: Finished difference Result 3058 states and 4885 transitions. [2024-11-09 23:12:50,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:12:50,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 133 [2024-11-09 23:12:50,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:50,910 INFO L225 Difference]: With dead ends: 3058 [2024-11-09 23:12:50,910 INFO L226 Difference]: Without dead ends: 1987 [2024-11-09 23:12:50,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:12:50,940 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 1331 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 1624 mSolverCounterSat, 468 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 2092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 468 IncrementalHoareTripleChecker+Valid, 1624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:50,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1346 Valid, 916 Invalid, 2092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [468 Valid, 1624 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 23:12:50,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2024-11-09 23:12:51,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1792. [2024-11-09 23:12:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1471 states have (on average 1.5159755268524813) internal successors, (2230), 1478 states have internal predecessors, (2230), 293 states have call successors, (293), 23 states have call predecessors, (293), 27 states have return successors, (324), 292 states have call predecessors, (324), 292 states have call successors, (324) [2024-11-09 23:12:51,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2847 transitions. [2024-11-09 23:12:51,016 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2847 transitions. Word has length 133 [2024-11-09 23:12:51,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:51,016 INFO L471 AbstractCegarLoop]: Abstraction has 1792 states and 2847 transitions. [2024-11-09 23:12:51,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:12:51,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2847 transitions. [2024-11-09 23:12:51,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 23:12:51,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:51,025 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:51,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:12:51,026 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:51,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:51,026 INFO L85 PathProgramCache]: Analyzing trace with hash -448992511, now seen corresponding path program 1 times [2024-11-09 23:12:51,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:51,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208106654] [2024-11-09 23:12:51,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:51,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:51,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:51,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:51,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:51,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:51,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:51,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:51,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 23:12:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:51,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 23:12:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:51,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 23:12:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:51,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 23:12:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:51,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 23:12:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:51,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-09 23:12:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:51,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 23:12:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:51,135 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:12:51,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:51,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208106654] [2024-11-09 23:12:51,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208106654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:51,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:51,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:12:51,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305209301] [2024-11-09 23:12:51,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:51,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:12:51,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:51,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:12:51,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:12:51,138 INFO L87 Difference]: Start difference. First operand 1792 states and 2847 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:12:52,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:52,555 INFO L93 Difference]: Finished difference Result 4417 states and 7101 transitions. [2024-11-09 23:12:52,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:12:52,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 134 [2024-11-09 23:12:52,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:52,567 INFO L225 Difference]: With dead ends: 4417 [2024-11-09 23:12:52,568 INFO L226 Difference]: Without dead ends: 2893 [2024-11-09 23:12:52,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:12:52,572 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1479 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:52,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 871 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 23:12:52,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2893 states. [2024-11-09 23:12:52,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2893 to 2698. [2024-11-09 23:12:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2698 states, 2254 states have (on average 1.5164152617568767) internal successors, (3418), 2261 states have internal predecessors, (3418), 416 states have call successors, (416), 23 states have call predecessors, (416), 27 states have return successors, (463), 415 states have call predecessors, (463), 415 states have call successors, (463) [2024-11-09 23:12:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 4297 transitions. [2024-11-09 23:12:52,668 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 4297 transitions. Word has length 134 [2024-11-09 23:12:52,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:52,669 INFO L471 AbstractCegarLoop]: Abstraction has 2698 states and 4297 transitions. [2024-11-09 23:12:52,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:12:52,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 4297 transitions. [2024-11-09 23:12:52,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 23:12:52,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:52,679 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:52,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:12:52,680 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:52,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:52,680 INFO L85 PathProgramCache]: Analyzing trace with hash 533184770, now seen corresponding path program 1 times [2024-11-09 23:12:52,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:52,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902076664] [2024-11-09 23:12:52,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:52,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:52,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:52,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:52,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:52,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:52,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:52,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:52,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 23:12:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:52,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 23:12:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:52,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 23:12:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:52,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 23:12:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:52,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-09 23:12:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:52,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 23:12:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:52,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-09 23:12:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:12:52,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:52,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902076664] [2024-11-09 23:12:52,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902076664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:52,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:52,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:12:52,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381106094] [2024-11-09 23:12:52,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:52,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:12:52,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:52,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:12:52,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:12:52,818 INFO L87 Difference]: Start difference. First operand 2698 states and 4297 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:12:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:54,220 INFO L93 Difference]: Finished difference Result 6553 states and 10577 transitions. [2024-11-09 23:12:54,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:12:54,220 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 135 [2024-11-09 23:12:54,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:54,242 INFO L225 Difference]: With dead ends: 6553 [2024-11-09 23:12:54,242 INFO L226 Difference]: Without dead ends: 4353 [2024-11-09 23:12:54,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:12:54,251 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1395 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 491 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1410 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 2022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 491 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:54,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1410 Valid, 871 Invalid, 2022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [491 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 23:12:54,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4353 states. [2024-11-09 23:12:54,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4353 to 4158. [2024-11-09 23:12:54,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4158 states, 3535 states have (on average 1.5151343705799152) internal successors, (5356), 3542 states have internal predecessors, (5356), 595 states have call successors, (595), 23 states have call predecessors, (595), 27 states have return successors, (668), 594 states have call predecessors, (668), 594 states have call successors, (668) [2024-11-09 23:12:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4158 states to 4158 states and 6619 transitions. [2024-11-09 23:12:54,433 INFO L78 Accepts]: Start accepts. Automaton has 4158 states and 6619 transitions. Word has length 135 [2024-11-09 23:12:54,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:54,433 INFO L471 AbstractCegarLoop]: Abstraction has 4158 states and 6619 transitions. [2024-11-09 23:12:54,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:12:54,434 INFO L276 IsEmpty]: Start isEmpty. Operand 4158 states and 6619 transitions. [2024-11-09 23:12:54,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 23:12:54,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:54,446 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:54,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 23:12:54,446 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:54,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:54,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2087908481, now seen corresponding path program 1 times [2024-11-09 23:12:54,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:54,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330908669] [2024-11-09 23:12:54,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:54,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:54,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:54,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:54,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:54,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:54,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:54,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:54,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 23:12:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:54,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 23:12:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:54,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 23:12:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:54,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 23:12:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:54,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 23:12:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:54,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 23:12:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:54,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 23:12:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:54,557 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:12:54,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:54,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330908669] [2024-11-09 23:12:54,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330908669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:54,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:54,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:12:54,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751441972] [2024-11-09 23:12:54,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:54,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:12:54,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:54,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:12:54,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:12:54,558 INFO L87 Difference]: Start difference. First operand 4158 states and 6619 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:12:56,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:56,036 INFO L93 Difference]: Finished difference Result 10096 states and 16319 transitions. [2024-11-09 23:12:56,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:12:56,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 136 [2024-11-09 23:12:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:56,070 INFO L225 Difference]: With dead ends: 10096 [2024-11-09 23:12:56,070 INFO L226 Difference]: Without dead ends: 6790 [2024-11-09 23:12:56,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:12:56,082 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 1412 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 500 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 500 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:56,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 920 Invalid, 2021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [500 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 23:12:56,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6790 states. [2024-11-09 23:12:56,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6790 to 6595. [2024-11-09 23:12:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6595 states, 5596 states have (on average 1.5035739814152966) internal successors, (8414), 5603 states have internal predecessors, (8414), 971 states have call successors, (971), 23 states have call predecessors, (971), 27 states have return successors, (1088), 970 states have call predecessors, (1088), 970 states have call successors, (1088) [2024-11-09 23:12:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6595 states to 6595 states and 10473 transitions. [2024-11-09 23:12:56,399 INFO L78 Accepts]: Start accepts. Automaton has 6595 states and 10473 transitions. Word has length 136 [2024-11-09 23:12:56,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:56,400 INFO L471 AbstractCegarLoop]: Abstraction has 6595 states and 10473 transitions. [2024-11-09 23:12:56,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:12:56,401 INFO L276 IsEmpty]: Start isEmpty. Operand 6595 states and 10473 transitions. [2024-11-09 23:12:56,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 23:12:56,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:56,423 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:56,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:12:56,423 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:56,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:56,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1684114750, now seen corresponding path program 1 times [2024-11-09 23:12:56,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:56,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010911851] [2024-11-09 23:12:56,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:56,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:56,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:56,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:56,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:56,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:56,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:56,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:56,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 23:12:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:56,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:12:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:56,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 23:12:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:56,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 23:12:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:56,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 23:12:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:56,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 23:12:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:56,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 23:12:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:56,561 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:12:56,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:56,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010911851] [2024-11-09 23:12:56,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010911851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:56,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:56,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:12:56,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375329870] [2024-11-09 23:12:56,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:56,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:12:56,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:56,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:12:56,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:12:56,564 INFO L87 Difference]: Start difference. First operand 6595 states and 10473 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:12:58,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:58,097 INFO L93 Difference]: Finished difference Result 16519 states and 26626 transitions. [2024-11-09 23:12:58,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:12:58,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 137 [2024-11-09 23:12:58,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:58,151 INFO L225 Difference]: With dead ends: 16519 [2024-11-09 23:12:58,151 INFO L226 Difference]: Without dead ends: 11215 [2024-11-09 23:12:58,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:12:58,166 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 1375 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1390 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 2039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:58,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1390 Valid, 873 Invalid, 2039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 23:12:58,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11215 states. [2024-11-09 23:12:58,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11215 to 11020. [2024-11-09 23:12:58,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11020 states, 9415 states have (on average 1.497822623473181) internal successors, (14102), 9422 states have internal predecessors, (14102), 1577 states have call successors, (1577), 23 states have call predecessors, (1577), 27 states have return successors, (1772), 1576 states have call predecessors, (1772), 1576 states have call successors, (1772) [2024-11-09 23:12:58,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11020 states to 11020 states and 17451 transitions. [2024-11-09 23:12:58,602 INFO L78 Accepts]: Start accepts. Automaton has 11020 states and 17451 transitions. Word has length 137 [2024-11-09 23:12:58,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:58,602 INFO L471 AbstractCegarLoop]: Abstraction has 11020 states and 17451 transitions. [2024-11-09 23:12:58,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:12:58,603 INFO L276 IsEmpty]: Start isEmpty. Operand 11020 states and 17451 transitions. [2024-11-09 23:12:58,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 23:12:58,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:58,629 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:58,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 23:12:58,629 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:58,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:58,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1472605601, now seen corresponding path program 1 times [2024-11-09 23:12:58,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:58,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729012907] [2024-11-09 23:12:58,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:58,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:58,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:58,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:58,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:58,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:58,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:58,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:58,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 23:12:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:58,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 23:12:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:58,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 23:12:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:58,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 23:12:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:58,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 23:12:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:58,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 23:12:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:58,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 23:12:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:58,741 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:12:58,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:58,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729012907] [2024-11-09 23:12:58,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729012907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:58,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:58,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:12:58,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865673654] [2024-11-09 23:12:58,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:58,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:12:58,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:58,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:12:58,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:12:58,743 INFO L87 Difference]: Start difference. First operand 11020 states and 17451 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:13:00,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:00,281 INFO L93 Difference]: Finished difference Result 28758 states and 46227 transitions. [2024-11-09 23:13:00,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:13:00,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 138 [2024-11-09 23:13:00,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:00,429 INFO L225 Difference]: With dead ends: 28758 [2024-11-09 23:13:00,430 INFO L226 Difference]: Without dead ends: 19567 [2024-11-09 23:13:00,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:13:00,461 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1416 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 504 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1431 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 2004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 504 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:00,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1431 Valid, 890 Invalid, 2004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [504 Valid, 1500 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 23:13:00,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19567 states. [2024-11-09 23:13:01,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19567 to 19372. [2024-11-09 23:13:01,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19372 states, 16564 states have (on average 1.4877445061579329) internal successors, (24643), 16571 states have internal predecessors, (24643), 2780 states have call successors, (2780), 23 states have call predecessors, (2780), 27 states have return successors, (3119), 2779 states have call predecessors, (3119), 2779 states have call successors, (3119) [2024-11-09 23:13:01,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19372 states to 19372 states and 30542 transitions. [2024-11-09 23:13:01,238 INFO L78 Accepts]: Start accepts. Automaton has 19372 states and 30542 transitions. Word has length 138 [2024-11-09 23:13:01,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:01,238 INFO L471 AbstractCegarLoop]: Abstraction has 19372 states and 30542 transitions. [2024-11-09 23:13:01,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:13:01,239 INFO L276 IsEmpty]: Start isEmpty. Operand 19372 states and 30542 transitions. [2024-11-09 23:13:01,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 23:13:01,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:01,270 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:13:01,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 23:13:01,271 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:01,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:01,271 INFO L85 PathProgramCache]: Analyzing trace with hash -2138028222, now seen corresponding path program 1 times [2024-11-09 23:13:01,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:01,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674159310] [2024-11-09 23:13:01,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:01,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:01,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:01,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:01,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:01,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:13:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:01,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:13:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:01,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:13:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:01,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 23:13:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:01,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 23:13:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:01,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 23:13:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:01,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 23:13:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:01,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 23:13:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:01,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 23:13:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:01,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-09 23:13:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:01,392 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:13:01,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:01,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674159310] [2024-11-09 23:13:01,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674159310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:01,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:13:01,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:13:01,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026642684] [2024-11-09 23:13:01,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:01,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:13:01,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:01,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:13:01,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:13:01,395 INFO L87 Difference]: Start difference. First operand 19372 states and 30542 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:13:03,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:03,222 INFO L93 Difference]: Finished difference Result 51706 states and 82808 transitions. [2024-11-09 23:13:03,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:13:03,222 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 139 [2024-11-09 23:13:03,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:03,367 INFO L225 Difference]: With dead ends: 51706 [2024-11-09 23:13:03,367 INFO L226 Difference]: Without dead ends: 34919 [2024-11-09 23:13:03,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:13:03,422 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1333 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 480 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 2032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 480 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:03,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 875 Invalid, 2032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [480 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 23:13:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34919 states. [2024-11-09 23:13:04,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34919 to 34724. [2024-11-09 23:13:04,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34724 states, 29877 states have (on average 1.4808715734511497) internal successors, (44244), 29884 states have internal predecessors, (44244), 4819 states have call successors, (4819), 23 states have call predecessors, (4819), 27 states have return successors, (5432), 4818 states have call predecessors, (5432), 4818 states have call successors, (5432) [2024-11-09 23:13:04,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34724 states to 34724 states and 54495 transitions. [2024-11-09 23:13:04,975 INFO L78 Accepts]: Start accepts. Automaton has 34724 states and 54495 transitions. Word has length 139 [2024-11-09 23:13:04,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:04,976 INFO L471 AbstractCegarLoop]: Abstraction has 34724 states and 54495 transitions. [2024-11-09 23:13:04,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:13:04,976 INFO L276 IsEmpty]: Start isEmpty. Operand 34724 states and 54495 transitions. [2024-11-09 23:13:05,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 23:13:05,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:05,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, 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:13:05,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 23:13:05,011 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:05,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:05,012 INFO L85 PathProgramCache]: Analyzing trace with hash -260848991, now seen corresponding path program 1 times [2024-11-09 23:13:05,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:05,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092613189] [2024-11-09 23:13:05,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:05,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:13:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:13:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:13:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 23:13:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 23:13:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 23:13:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 23:13:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 23:13:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-09 23:13:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 23:13:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,145 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:13:05,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:05,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092613189] [2024-11-09 23:13:05,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092613189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:05,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:13:05,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:13:05,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240495589] [2024-11-09 23:13:05,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:05,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:13:05,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:05,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:13:05,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:13:05,149 INFO L87 Difference]: Start difference. First operand 34724 states and 54495 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:13:08,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:08,094 INFO L93 Difference]: Finished difference Result 95295 states and 151394 transitions. [2024-11-09 23:13:08,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:13:08,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 140 [2024-11-09 23:13:08,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:08,575 INFO L225 Difference]: With dead ends: 95295 [2024-11-09 23:13:08,575 INFO L226 Difference]: Without dead ends: 64074 [2024-11-09 23:13:08,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:13:08,646 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 1306 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1321 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 2061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:08,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1321 Valid, 877 Invalid, 2061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 23:13:08,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64074 states. [2024-11-09 23:13:10,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64074 to 63879. [2024-11-09 23:13:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63879 states, 55317 states have (on average 1.473127609957156) internal successors, (81489), 55324 states have internal predecessors, (81489), 8534 states have call successors, (8534), 23 states have call predecessors, (8534), 27 states have return successors, (9679), 8533 states have call predecessors, (9679), 8533 states have call successors, (9679) [2024-11-09 23:13:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63879 states to 63879 states and 99702 transitions. [2024-11-09 23:13:11,196 INFO L78 Accepts]: Start accepts. Automaton has 63879 states and 99702 transitions. Word has length 140 [2024-11-09 23:13:11,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:11,197 INFO L471 AbstractCegarLoop]: Abstraction has 63879 states and 99702 transitions. [2024-11-09 23:13:11,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:13:11,198 INFO L276 IsEmpty]: Start isEmpty. Operand 63879 states and 99702 transitions. [2024-11-09 23:13:11,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 23:13:11,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:11,221 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:13:11,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 23:13:11,221 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:11,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:11,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1877140446, now seen corresponding path program 1 times [2024-11-09 23:13:11,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:11,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030273831] [2024-11-09 23:13:11,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:11,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:13:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:13:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:13:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 23:13:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 23:13:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 23:13:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-09 23:13:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-09 23:13:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 23:13:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-09 23:13:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,342 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:13:11,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:11,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030273831] [2024-11-09 23:13:11,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030273831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:11,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:13:11,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:13:11,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870013894] [2024-11-09 23:13:11,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:11,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:13:11,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:11,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:13:11,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:13:11,346 INFO L87 Difference]: Start difference. First operand 63879 states and 99702 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:13:14,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:14,758 INFO L93 Difference]: Finished difference Result 120159 states and 190674 transitions. [2024-11-09 23:13:14,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:13:14,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 141 [2024-11-09 23:13:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:15,283 INFO L225 Difference]: With dead ends: 120159 [2024-11-09 23:13:15,283 INFO L226 Difference]: Without dead ends: 119948 [2024-11-09 23:13:15,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:13:15,343 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1356 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1370 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:15,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1370 Valid, 881 Invalid, 2021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 23:13:15,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119948 states. [2024-11-09 23:13:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119948 to 119753. [2024-11-09 23:13:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119753 states, 104392 states have (on average 1.4644225611157944) internal successors, (152874), 104399 states have internal predecessors, (152874), 15333 states have call successors, (15333), 23 states have call predecessors, (15333), 27 states have return successors, (17524), 15332 states have call predecessors, (17524), 15332 states have call successors, (17524) [2024-11-09 23:13:18,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119753 states to 119753 states and 185731 transitions. [2024-11-09 23:13:19,007 INFO L78 Accepts]: Start accepts. Automaton has 119753 states and 185731 transitions. Word has length 141 [2024-11-09 23:13:19,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:19,007 INFO L471 AbstractCegarLoop]: Abstraction has 119753 states and 185731 transitions. [2024-11-09 23:13:19,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:13:19,007 INFO L276 IsEmpty]: Start isEmpty. Operand 119753 states and 185731 transitions. [2024-11-09 23:13:19,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-09 23:13:19,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:19,528 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:13:19,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 23:13:19,528 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:19,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:19,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1267020895, now seen corresponding path program 1 times [2024-11-09 23:13:19,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:19,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47772686] [2024-11-09 23:13:19,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:19,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:13:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:13:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:13:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:13:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 23:13:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 23:13:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 23:13:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 23:13:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:20,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-09 23:13:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:20,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 23:13:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:20,033 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:13:20,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:20,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47772686] [2024-11-09 23:13:20,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47772686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:20,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:13:20,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-09 23:13:20,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547539328] [2024-11-09 23:13:20,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:20,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 23:13:20,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:20,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 23:13:20,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:13:20,036 INFO L87 Difference]: Start difference. First operand 119753 states and 185731 transitions. Second operand has 18 states, 16 states have (on average 6.3125) internal successors, (101), 12 states have internal predecessors, (101), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-09 23:13:30,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:30,435 INFO L93 Difference]: Finished difference Result 239584 states and 383530 transitions. [2024-11-09 23:13:30,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-09 23:13:30,435 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.3125) internal successors, (101), 12 states have internal predecessors, (101), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 142 [2024-11-09 23:13:30,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:31,602 INFO L225 Difference]: With dead ends: 239584 [2024-11-09 23:13:31,602 INFO L226 Difference]: Without dead ends: 239379 [2024-11-09 23:13:31,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1375 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=900, Invalid=4070, Unknown=0, NotChecked=0, Total=4970 [2024-11-09 23:13:31,676 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 5403 mSDsluCounter, 2923 mSDsCounter, 0 mSdLazyCounter, 9143 mSolverCounterSat, 1933 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5403 SdHoareTripleChecker+Valid, 3165 SdHoareTripleChecker+Invalid, 11076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1933 IncrementalHoareTripleChecker+Valid, 9143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:31,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5403 Valid, 3165 Invalid, 11076 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1933 Valid, 9143 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-09 23:13:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239379 states. [2024-11-09 23:13:38,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239379 to 238516. [2024-11-09 23:13:38,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238516 states, 207968 states have (on average 1.4651869518387444) internal successors, (304712), 207873 states have internal predecessors, (304712), 30476 states have call successors, (30476), 62 states have call predecessors, (30476), 71 states have return successors, (38135), 30586 states have call predecessors, (38135), 30473 states have call successors, (38135) [2024-11-09 23:13:39,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238516 states to 238516 states and 373323 transitions. [2024-11-09 23:13:39,744 INFO L78 Accepts]: Start accepts. Automaton has 238516 states and 373323 transitions. Word has length 142 [2024-11-09 23:13:39,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:39,745 INFO L471 AbstractCegarLoop]: Abstraction has 238516 states and 373323 transitions. [2024-11-09 23:13:39,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.3125) internal successors, (101), 12 states have internal predecessors, (101), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-09 23:13:39,745 INFO L276 IsEmpty]: Start isEmpty. Operand 238516 states and 373323 transitions. [2024-11-09 23:13:39,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 23:13:39,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:39,804 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:13:39,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 23:13:39,805 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:39,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:39,805 INFO L85 PathProgramCache]: Analyzing trace with hash -808138528, now seen corresponding path program 1 times [2024-11-09 23:13:39,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:39,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356718754] [2024-11-09 23:13:39,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:39,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms