./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec3_product18.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_spec3_product18.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d7d2bf487526d6e0729662c61851f9ddffc6ed66e923d4f96f5d4608e690fa4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:41:56,034 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:41:56,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:41:56,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:41:56,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:41:56,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:41:56,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:41:56,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:41:56,146 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:41:56,146 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:41:56,147 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:41:56,147 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:41:56,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:41:56,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:41:56,152 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:41:56,152 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:41:56,152 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:41:56,152 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:41:56,153 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:41:56,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:41:56,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:41:56,153 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:41:56,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:41:56,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:41:56,154 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:41:56,154 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:41:56,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:41:56,154 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:41:56,154 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:41:56,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:41:56,155 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:41:56,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:41:56,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:41:56,155 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:41:56,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:41:56,155 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:41:56,156 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:41:56,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:41:56,156 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:41:56,156 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:41:56,156 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:41:56,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:41:56,158 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 -> 8d7d2bf487526d6e0729662c61851f9ddffc6ed66e923d4f96f5d4608e690fa4 [2024-11-11 20:41:56,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:41:56,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:41:56,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:41:56,404 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:41:56,404 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:41:56,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec3_product18.cil.c [2024-11-11 20:41:57,714 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:41:57,943 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:41:57,943 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product18.cil.c [2024-11-11 20:41:57,968 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd8a8dade/7fdfe8f8494b4e4e84162238f7f02be7/FLAGc556a2b36 [2024-11-11 20:41:57,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd8a8dade/7fdfe8f8494b4e4e84162238f7f02be7 [2024-11-11 20:41:57,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:41:57,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:41:57,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:41:57,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:41:57,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:41:57,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:41:57" (1/1) ... [2024-11-11 20:41:57,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e97e10a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:41:57, skipping insertion in model container [2024-11-11 20:41:57,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:41:57" (1/1) ... [2024-11-11 20:41:58,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:41:58,448 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_spec3_product18.cil.c[42127,42140] [2024-11-11 20:41:58,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:41:58,516 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:41:58,525 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2024-11-11 20:41:58,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [97] [2024-11-11 20:41:58,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1177] [2024-11-11 20:41:58,526 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1470] [2024-11-11 20:41:58,527 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1836] [2024-11-11 20:41:58,527 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1845] [2024-11-11 20:41:58,527 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2147] [2024-11-11 20:41:58,527 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [2550] [2024-11-11 20:41:58,527 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2608] [2024-11-11 20:41:58,527 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2824] [2024-11-11 20:41:58,527 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2921] [2024-11-11 20:41:58,612 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_spec3_product18.cil.c[42127,42140] [2024-11-11 20:41:58,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:41:58,670 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:41:58,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:41:58 WrapperNode [2024-11-11 20:41:58,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:41:58,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:41:58,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:41:58,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:41:58,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:41:58" (1/1) ... [2024-11-11 20:41:58,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:41:58" (1/1) ... [2024-11-11 20:41:58,750 INFO L138 Inliner]: procedures = 128, calls = 192, calls flagged for inlining = 57, calls inlined = 48, statements flattened = 882 [2024-11-11 20:41:58,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:41:58,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:41:58,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:41:58,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:41:58,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:41:58" (1/1) ... [2024-11-11 20:41:58,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:41:58" (1/1) ... [2024-11-11 20:41:58,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:41:58" (1/1) ... [2024-11-11 20:41:58,797 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-11 20:41:58,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:41:58" (1/1) ... [2024-11-11 20:41:58,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:41:58" (1/1) ... [2024-11-11 20:41:58,811 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:41:58" (1/1) ... [2024-11-11 20:41:58,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:41:58" (1/1) ... [2024-11-11 20:41:58,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:41:58" (1/1) ... [2024-11-11 20:41:58,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:41:58" (1/1) ... [2024-11-11 20:41:58,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:41:58,850 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:41:58,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:41:58,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:41:58,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:41:58" (1/1) ... [2024-11-11 20:41:58,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:41:58,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:41:58,889 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-11 20:41:58,897 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-11 20:41:58,934 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-11 20:41:58,934 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-11 20:41:58,934 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-11 20:41:58,935 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-11 20:41:58,935 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-11 20:41:58,935 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-11 20:41:58,935 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-11 20:41:58,936 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-11 20:41:58,936 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-11 20:41:58,936 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-11 20:41:58,936 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-11 20:41:58,936 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-11 20:41:58,936 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-11 20:41:58,937 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-11 20:41:58,937 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-11 20:41:58,937 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-11 20:41:58,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:41:58,937 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-11 20:41:58,938 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-11 20:41:58,938 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-11-11 20:41:58,938 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-11-11 20:41:58,939 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-11 20:41:58,939 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-11 20:41:58,939 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-11-11 20:41:58,939 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-11-11 20:41:58,939 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-11 20:41:58,939 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-11 20:41:58,939 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-11 20:41:58,939 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-11 20:41:58,939 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-11-11 20:41:58,939 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-11-11 20:41:58,940 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-11 20:41:58,940 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-11 20:41:58,940 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-11 20:41:58,940 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-11 20:41:58,940 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-11 20:41:58,940 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-11 20:41:58,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:41:58,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:41:58,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:41:58,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:41:58,940 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-11 20:41:58,940 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-11 20:41:58,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:41:58,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:41:59,088 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:41:59,090 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:41:59,717 INFO L? ?]: Removed 393 outVars from TransFormulas that were not future-live. [2024-11-11 20:41:59,717 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:41:59,743 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:41:59,743 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:41:59,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:41:59 BoogieIcfgContainer [2024-11-11 20:41:59,743 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:41:59,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:41:59,745 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:41:59,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:41:59,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:41:57" (1/3) ... [2024-11-11 20:41:59,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11419a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:41:59, skipping insertion in model container [2024-11-11 20:41:59,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:41:58" (2/3) ... [2024-11-11 20:41:59,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11419a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:41:59, skipping insertion in model container [2024-11-11 20:41:59,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:41:59" (3/3) ... [2024-11-11 20:41:59,752 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec3_product18.cil.c [2024-11-11 20:41:59,765 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:41:59,766 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:41:59,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:41:59,834 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;@58b3cb68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:41:59,835 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:41:59,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 306 states, 239 states have (on average 1.5313807531380754) internal successors, (366), 243 states have internal predecessors, (366), 46 states have call successors, (46), 19 states have call predecessors, (46), 19 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-11 20:41:59,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 20:41:59,855 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:41:59,856 INFO L218 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] [2024-11-11 20:41:59,856 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:41:59,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:41:59,861 INFO L85 PathProgramCache]: Analyzing trace with hash 948758550, now seen corresponding path program 1 times [2024-11-11 20:41:59,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:41:59,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326261751] [2024-11-11 20:41:59,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:41:59,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:00,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:00,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:00,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:00,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:42:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:00,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:42:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:00,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:42:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:00,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:42:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:00,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 20:42:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:00,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:42:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:00,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:42:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:00,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:42:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:00,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:42:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:00,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:42:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:00,461 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-11 20:42:00,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:00,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326261751] [2024-11-11 20:42:00,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326261751] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:42:00,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215249364] [2024-11-11 20:42:00,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:00,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:42:00,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:42:00,465 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-11 20:42:00,467 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-11 20:42:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:00,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 20:42:00,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:42:00,756 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-11 20:42:00,758 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:42:00,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215249364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:42:00,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:42:00,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-11 20:42:00,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195738696] [2024-11-11 20:42:00,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:42:00,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:42:00,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:00,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:42:00,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:42:00,806 INFO L87 Difference]: Start difference. First operand has 306 states, 239 states have (on average 1.5313807531380754) internal successors, (366), 243 states have internal predecessors, (366), 46 states have call successors, (46), 19 states have call predecessors, (46), 19 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:00,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:00,849 INFO L93 Difference]: Finished difference Result 457 states and 670 transitions. [2024-11-11 20:42:00,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:42:00,851 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 103 [2024-11-11 20:42:00,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:00,861 INFO L225 Difference]: With dead ends: 457 [2024-11-11 20:42:00,861 INFO L226 Difference]: Without dead ends: 298 [2024-11-11 20:42:00,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 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-11 20:42:00,868 INFO L435 NwaCegarLoop]: 452 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, 452 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-11 20:42:00,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:42:00,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-11 20:42:00,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2024-11-11 20:42:00,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 233 states have (on average 1.5236051502145922) internal successors, (355), 235 states have internal predecessors, (355), 46 states have call successors, (46), 19 states have call predecessors, (46), 18 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-11 20:42:00,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 444 transitions. [2024-11-11 20:42:00,928 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 444 transitions. Word has length 103 [2024-11-11 20:42:00,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:42:00,933 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 444 transitions. [2024-11-11 20:42:00,934 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 444 transitions. [2024-11-11 20:42:00,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 20:42:00,943 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:42:00,943 INFO L218 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-11 20:42:00,964 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-11 20:42:01,143 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-11 20:42:01,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:42:01,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:42:01,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1272549204, now seen corresponding path program 1 times [2024-11-11 20:42:01,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:42:01,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897516455] [2024-11-11 20:42:01,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:01,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:01,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:01,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:01,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:01,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:42:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:01,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:42:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:01,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:42:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:01,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:42:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:01,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:42:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:01,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:42:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:01,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:42:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:01,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:42:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:01,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:42:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:01,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:42:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:01,441 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-11 20:42:01,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:01,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897516455] [2024-11-11 20:42:01,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897516455] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:42:01,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940845744] [2024-11-11 20:42:01,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:01,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:42:01,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:42:01,446 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-11 20:42:01,447 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-11 20:42:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:01,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 20:42:01,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:42:01,714 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-11 20:42:01,715 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:42:01,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940845744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:42:01,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:42:01,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-11 20:42:01,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671893504] [2024-11-11 20:42:01,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:42:01,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:42:01,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:01,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:42:01,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:42:01,718 INFO L87 Difference]: Start difference. First operand 298 states and 444 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:01,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:01,750 INFO L93 Difference]: Finished difference Result 446 states and 647 transitions. [2024-11-11 20:42:01,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:42:01,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2024-11-11 20:42:01,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:01,753 INFO L225 Difference]: With dead ends: 446 [2024-11-11 20:42:01,753 INFO L226 Difference]: Without dead ends: 301 [2024-11-11 20:42:01,754 INFO L434 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-11 20:42:01,758 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 1 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:42:01,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 882 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:42:01,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-11 20:42:01,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2024-11-11 20:42:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 235 states have (on average 1.5191489361702128) internal successors, (357), 237 states have internal predecessors, (357), 46 states have call successors, (46), 19 states have call predecessors, (46), 18 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-11 20:42:01,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 446 transitions. [2024-11-11 20:42:01,777 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 446 transitions. Word has length 104 [2024-11-11 20:42:01,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:42:01,778 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 446 transitions. [2024-11-11 20:42:01,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:01,778 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 446 transitions. [2024-11-11 20:42:01,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 20:42:01,780 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:42:01,780 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:42:01,794 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-11 20:42:01,981 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-11 20:42:01,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:42:01,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:42:01,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1951991519, now seen corresponding path program 1 times [2024-11-11 20:42:01,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:42:01,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763267049] [2024-11-11 20:42:01,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:01,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:42:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:42:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:42:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:42:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:42:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:42:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:42:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:42:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:42:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:42:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:42:02,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:02,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763267049] [2024-11-11 20:42:02,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763267049] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:42:02,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247333230] [2024-11-11 20:42:02,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:02,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:42:02,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:42:02,200 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-11 20:42:02,202 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-11 20:42:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:42:02,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:42:02,453 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:42:02,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:42:02,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247333230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:42:02,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:42:02,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-11 20:42:02,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647434593] [2024-11-11 20:42:02,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:42:02,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:42:02,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:02,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:42:02,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:42:02,455 INFO L87 Difference]: Start difference. First operand 300 states and 446 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:02,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:02,473 INFO L93 Difference]: Finished difference Result 630 states and 951 transitions. [2024-11-11 20:42:02,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:42:02,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 113 [2024-11-11 20:42:02,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:02,485 INFO L225 Difference]: With dead ends: 630 [2024-11-11 20:42:02,485 INFO L226 Difference]: Without dead ends: 357 [2024-11-11 20:42:02,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:42:02,489 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 107 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 845 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-11 20:42:02,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 845 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:42:02,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-11 20:42:02,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 349. [2024-11-11 20:42:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 273 states have (on average 1.534798534798535) internal successors, (419), 275 states have internal predecessors, (419), 57 states have call successors, (57), 19 states have call predecessors, (57), 18 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-11 20:42:02,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 530 transitions. [2024-11-11 20:42:02,504 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 530 transitions. Word has length 113 [2024-11-11 20:42:02,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:42:02,504 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 530 transitions. [2024-11-11 20:42:02,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:02,504 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 530 transitions. [2024-11-11 20:42:02,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-11 20:42:02,506 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:42:02,506 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:42:02,521 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-11 20:42:02,707 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-11 20:42:02,707 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:42:02,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:42:02,708 INFO L85 PathProgramCache]: Analyzing trace with hash -54428775, now seen corresponding path program 1 times [2024-11-11 20:42:02,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:42:02,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069643152] [2024-11-11 20:42:02,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:02,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:42:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:42:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:42:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:42:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:42:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:42:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:42:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:42:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:42:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:42:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:42:02,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:02,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069643152] [2024-11-11 20:42:02,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069643152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:42:02,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702489509] [2024-11-11 20:42:02,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:02,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:42:02,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:42:02,897 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-11 20:42:02,899 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-11 20:42:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:03,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:42:03,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:42:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:42:03,184 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:42:03,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702489509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:42:03,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:42:03,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-11 20:42:03,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701219505] [2024-11-11 20:42:03,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:42:03,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:42:03,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:03,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:42:03,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:42:03,186 INFO L87 Difference]: Start difference. First operand 349 states and 530 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:42:03,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:03,238 INFO L93 Difference]: Finished difference Result 689 states and 1050 transitions. [2024-11-11 20:42:03,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:42:03,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2024-11-11 20:42:03,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:03,244 INFO L225 Difference]: With dead ends: 689 [2024-11-11 20:42:03,244 INFO L226 Difference]: Without dead ends: 351 [2024-11-11 20:42:03,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 133 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-11 20:42:03,247 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 2 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1733 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-11 20:42:03,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1733 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:42:03,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-11 20:42:03,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2024-11-11 20:42:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 274 states have (on average 1.532846715328467) internal successors, (420), 277 states have internal predecessors, (420), 57 states have call successors, (57), 19 states have call predecessors, (57), 19 states have return successors, (56), 54 states have call predecessors, (56), 54 states have call successors, (56) [2024-11-11 20:42:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 533 transitions. [2024-11-11 20:42:03,263 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 533 transitions. Word has length 114 [2024-11-11 20:42:03,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:42:03,264 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 533 transitions. [2024-11-11 20:42:03,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:42:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 533 transitions. [2024-11-11 20:42:03,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-11 20:42:03,266 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:42:03,266 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:42:03,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 20:42:03,466 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-11 20:42:03,467 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:42:03,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:42:03,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1752271268, now seen corresponding path program 1 times [2024-11-11 20:42:03,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:42:03,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512944294] [2024-11-11 20:42:03,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:03,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:03,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:03,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:03,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:03,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:42:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:03,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:42:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:03,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:42:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:03,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:42:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:03,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:42:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:03,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:42:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:03,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:42:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:03,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:42:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:03,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:42:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:03,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:42:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:03,708 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:42:03,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:03,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512944294] [2024-11-11 20:42:03,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512944294] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:42:03,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330999779] [2024-11-11 20:42:03,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:03,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:42:03,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:42:03,712 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-11 20:42:03,714 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-11 20:42:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:03,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 20:42:03,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:42:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:42:03,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:42:03,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330999779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:42:03,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:42:03,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-11 20:42:03,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788940276] [2024-11-11 20:42:03,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:42:03,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:42:03,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:03,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:42:03,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:42:03,980 INFO L87 Difference]: Start difference. First operand 351 states and 533 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:42:04,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:04,027 INFO L93 Difference]: Finished difference Result 691 states and 1055 transitions. [2024-11-11 20:42:04,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:42:04,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 115 [2024-11-11 20:42:04,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:04,030 INFO L225 Difference]: With dead ends: 691 [2024-11-11 20:42:04,030 INFO L226 Difference]: Without dead ends: 353 [2024-11-11 20:42:04,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 133 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-11 20:42:04,032 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 2 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:42:04,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1719 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:42:04,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-11 20:42:04,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2024-11-11 20:42:04,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 275 states have (on average 1.530909090909091) internal successors, (421), 279 states have internal predecessors, (421), 57 states have call successors, (57), 19 states have call predecessors, (57), 20 states have return successors, (61), 54 states have call predecessors, (61), 54 states have call successors, (61) [2024-11-11 20:42:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 539 transitions. [2024-11-11 20:42:04,050 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 539 transitions. Word has length 115 [2024-11-11 20:42:04,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:42:04,051 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 539 transitions. [2024-11-11 20:42:04,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:42:04,051 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 539 transitions. [2024-11-11 20:42:04,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-11 20:42:04,053 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:42:04,053 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:42:04,070 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-11 20:42:04,254 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-11 20:42:04,254 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:42:04,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:42:04,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1507339975, now seen corresponding path program 1 times [2024-11-11 20:42:04,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:42:04,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262112341] [2024-11-11 20:42:04,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:04,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:04,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:04,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:04,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:04,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:42:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:04,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:42:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:04,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:42:04,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:04,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:42:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:04,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 20:42:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:04,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:42:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:04,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:42:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:04,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:42:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:04,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:42:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:04,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:42:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:04,466 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:42:04,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:04,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262112341] [2024-11-11 20:42:04,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262112341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:42:04,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:42:04,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:42:04,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685629115] [2024-11-11 20:42:04,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:42:04,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:42:04,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:04,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:42:04,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:42:04,468 INFO L87 Difference]: Start difference. First operand 353 states and 539 transitions. Second operand has 9 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:42:05,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:05,894 INFO L93 Difference]: Finished difference Result 786 states and 1203 transitions. [2024-11-11 20:42:05,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:42:05,894 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 116 [2024-11-11 20:42:05,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:05,897 INFO L225 Difference]: With dead ends: 786 [2024-11-11 20:42:05,897 INFO L226 Difference]: Without dead ends: 456 [2024-11-11 20:42:05,898 INFO L434 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-11 20:42:05,899 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 930 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 2226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:42:05,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 1108 Invalid, 2226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:42:05,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-11 20:42:05,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 353. [2024-11-11 20:42:05,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 275 states have (on average 1.530909090909091) internal successors, (421), 279 states have internal predecessors, (421), 57 states have call successors, (57), 19 states have call predecessors, (57), 20 states have return successors, (60), 54 states have call predecessors, (60), 54 states have call successors, (60) [2024-11-11 20:42:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 538 transitions. [2024-11-11 20:42:05,929 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 538 transitions. Word has length 116 [2024-11-11 20:42:05,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:42:05,929 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 538 transitions. [2024-11-11 20:42:05,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:42:05,929 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 538 transitions. [2024-11-11 20:42:05,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-11 20:42:05,932 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:42:05,932 INFO L218 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] [2024-11-11 20:42:05,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:42:05,932 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:42:05,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:42:05,933 INFO L85 PathProgramCache]: Analyzing trace with hash -367677154, now seen corresponding path program 2 times [2024-11-11 20:42:05,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:42:05,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845784002] [2024-11-11 20:42:05,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:05,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:06,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:06,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:06,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:06,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:42:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:06,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:42:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:06,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:42:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:06,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:42:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:06,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:42:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:06,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:42:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:06,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:42:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:06,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:42:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:06,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:42:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:06,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:42:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:42:06,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:06,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845784002] [2024-11-11 20:42:06,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845784002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:42:06,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:42:06,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:42:06,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795005724] [2024-11-11 20:42:06,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:42:06,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:42:06,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:06,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:42:06,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:42:06,135 INFO L87 Difference]: Start difference. First operand 353 states and 538 transitions. Second operand has 9 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:42:07,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:07,494 INFO L93 Difference]: Finished difference Result 788 states and 1206 transitions. [2024-11-11 20:42:07,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:42:07,495 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 117 [2024-11-11 20:42:07,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:07,497 INFO L225 Difference]: With dead ends: 788 [2024-11-11 20:42:07,497 INFO L226 Difference]: Without dead ends: 458 [2024-11-11 20:42:07,498 INFO L434 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-11 20:42:07,499 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 927 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 1951 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 2224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 1951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:42:07,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1107 Invalid, 2224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 1951 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:42:07,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-11 20:42:07,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 355. [2024-11-11 20:42:07,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 276 states have (on average 1.5289855072463767) internal successors, (422), 281 states have internal predecessors, (422), 57 states have call successors, (57), 19 states have call predecessors, (57), 21 states have return successors, (62), 54 states have call predecessors, (62), 54 states have call successors, (62) [2024-11-11 20:42:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 541 transitions. [2024-11-11 20:42:07,525 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 541 transitions. Word has length 117 [2024-11-11 20:42:07,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:42:07,525 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 541 transitions. [2024-11-11 20:42:07,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:42:07,526 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 541 transitions. [2024-11-11 20:42:07,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-11 20:42:07,527 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:42:07,527 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:42:07,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:42:07,527 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:42:07,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:42:07,528 INFO L85 PathProgramCache]: Analyzing trace with hash 224059508, now seen corresponding path program 1 times [2024-11-11 20:42:07,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:42:07,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47473184] [2024-11-11 20:42:07,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:07,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:07,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:07,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:07,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:07,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:42:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:07,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:42:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:07,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:42:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:07,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:42:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:07,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:42:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:07,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:42:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:07,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:42:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:07,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:42:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:07,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:42:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:07,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:42:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:42:07,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:07,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47473184] [2024-11-11 20:42:07,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47473184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:42:07,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:42:07,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:42:07,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707366792] [2024-11-11 20:42:07,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:42:07,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:42:07,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:07,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:42:07,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:42:07,726 INFO L87 Difference]: Start difference. First operand 355 states and 541 transitions. Second operand has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-11 20:42:09,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:09,565 INFO L93 Difference]: Finished difference Result 786 states and 1201 transitions. [2024-11-11 20:42:09,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:42:09,565 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 118 [2024-11-11 20:42:09,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:09,568 INFO L225 Difference]: With dead ends: 786 [2024-11-11 20:42:09,569 INFO L226 Difference]: Without dead ends: 458 [2024-11-11 20:42:09,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-11 20:42:09,571 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 931 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 3267 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 3546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 3267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:42:09,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 1534 Invalid, 3546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 3267 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 20:42:09,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-11 20:42:09,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 355. [2024-11-11 20:42:09,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 276 states have (on average 1.5289855072463767) internal successors, (422), 281 states have internal predecessors, (422), 57 states have call successors, (57), 19 states have call predecessors, (57), 21 states have return successors, (61), 54 states have call predecessors, (61), 54 states have call successors, (61) [2024-11-11 20:42:09,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 540 transitions. [2024-11-11 20:42:09,595 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 540 transitions. Word has length 118 [2024-11-11 20:42:09,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:42:09,596 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 540 transitions. [2024-11-11 20:42:09,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-11 20:42:09,596 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 540 transitions. [2024-11-11 20:42:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-11 20:42:09,598 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:42:09,598 INFO L218 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, 1] [2024-11-11 20:42:09,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:42:09,598 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:42:09,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:42:09,599 INFO L85 PathProgramCache]: Analyzing trace with hash 589463367, now seen corresponding path program 2 times [2024-11-11 20:42:09,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:42:09,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220050189] [2024-11-11 20:42:09,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:09,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:09,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:09,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:09,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:09,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:42:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:09,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:42:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:09,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:42:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:09,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:42:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:09,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:42:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:09,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:42:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:09,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:42:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:09,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:42:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:09,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:42:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:09,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:42:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:09,824 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:42:09,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:09,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220050189] [2024-11-11 20:42:09,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220050189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:42:09,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:42:09,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:42:09,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611020003] [2024-11-11 20:42:09,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:42:09,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:42:09,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:09,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:42:09,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:42:09,825 INFO L87 Difference]: Start difference. First operand 355 states and 540 transitions. Second operand has 12 states, 11 states have (on average 7.454545454545454) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-11 20:42:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:11,673 INFO L93 Difference]: Finished difference Result 788 states and 1207 transitions. [2024-11-11 20:42:11,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:42:11,673 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.454545454545454) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 119 [2024-11-11 20:42:11,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:11,676 INFO L225 Difference]: With dead ends: 788 [2024-11-11 20:42:11,676 INFO L226 Difference]: Without dead ends: 460 [2024-11-11 20:42:11,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-11 20:42:11,679 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 926 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 3319 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 3593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 3319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:42:11,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 1536 Invalid, 3593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 3319 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 20:42:11,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-11 20:42:11,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 357. [2024-11-11 20:42:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 277 states have (on average 1.5270758122743682) internal successors, (423), 283 states have internal predecessors, (423), 57 states have call successors, (57), 19 states have call predecessors, (57), 22 states have return successors, (66), 54 states have call predecessors, (66), 54 states have call successors, (66) [2024-11-11 20:42:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 546 transitions. [2024-11-11 20:42:11,701 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 546 transitions. Word has length 119 [2024-11-11 20:42:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:42:11,702 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 546 transitions. [2024-11-11 20:42:11,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.454545454545454) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-11 20:42:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 546 transitions. [2024-11-11 20:42:11,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-11 20:42:11,704 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:42:11,704 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:42:11,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:42:11,704 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:42:11,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:42:11,705 INFO L85 PathProgramCache]: Analyzing trace with hash 281189807, now seen corresponding path program 1 times [2024-11-11 20:42:11,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:42:11,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311662013] [2024-11-11 20:42:11,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:11,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:11,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:11,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:11,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:11,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:42:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:11,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:42:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:11,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:42:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:11,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:42:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:11,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:42:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:11,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:42:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:11,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:42:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:11,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:42:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:11,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:42:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:11,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:42:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:11,896 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-11 20:42:11,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:11,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311662013] [2024-11-11 20:42:11,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311662013] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:42:11,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695273418] [2024-11-11 20:42:11,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:11,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:42:11,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:42:11,899 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-11 20:42:11,900 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-11 20:42:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:12,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:42:12,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:42:12,154 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:42:12,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:42:12,245 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:42:12,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695273418] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:42:12,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:42:12,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-11-11 20:42:12,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498143104] [2024-11-11 20:42:12,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:42:12,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-11 20:42:12,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:12,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-11 20:42:12,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:42:12,250 INFO L87 Difference]: Start difference. First operand 357 states and 546 transitions. Second operand has 15 states, 14 states have (on average 9.714285714285714) internal successors, (136), 11 states have internal predecessors, (136), 4 states have call successors, (32), 6 states have call predecessors, (32), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-11 20:42:14,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:14,435 INFO L93 Difference]: Finished difference Result 1138 states and 1839 transitions. [2024-11-11 20:42:14,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-11 20:42:14,436 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 9.714285714285714) internal successors, (136), 11 states have internal predecessors, (136), 4 states have call successors, (32), 6 states have call predecessors, (32), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 120 [2024-11-11 20:42:14,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:14,440 INFO L225 Difference]: With dead ends: 1138 [2024-11-11 20:42:14,440 INFO L226 Difference]: Without dead ends: 812 [2024-11-11 20:42:14,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2024-11-11 20:42:14,442 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1911 mSDsluCounter, 1633 mSDsCounter, 0 mSdLazyCounter, 4117 mSolverCounterSat, 588 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1928 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 4705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 588 IncrementalHoareTripleChecker+Valid, 4117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:42:14,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1928 Valid, 1800 Invalid, 4705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [588 Valid, 4117 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-11 20:42:14,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2024-11-11 20:42:14,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 685. [2024-11-11 20:42:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 541 states have (on average 1.578558225508318) internal successors, (854), 547 states have internal predecessors, (854), 121 states have call successors, (121), 19 states have call predecessors, (121), 22 states have return successors, (140), 118 states have call predecessors, (140), 118 states have call successors, (140) [2024-11-11 20:42:14,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1115 transitions. [2024-11-11 20:42:14,470 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1115 transitions. Word has length 120 [2024-11-11 20:42:14,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:42:14,471 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1115 transitions. [2024-11-11 20:42:14,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 9.714285714285714) internal successors, (136), 11 states have internal predecessors, (136), 4 states have call successors, (32), 6 states have call predecessors, (32), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-11 20:42:14,471 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1115 transitions. [2024-11-11 20:42:14,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 20:42:14,473 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:42:14,473 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:42:14,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 20:42:14,677 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-11 20:42:14,677 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:42:14,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:42:14,678 INFO L85 PathProgramCache]: Analyzing trace with hash -513022652, now seen corresponding path program 1 times [2024-11-11 20:42:14,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:42:14,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739617046] [2024-11-11 20:42:14,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:14,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:14,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:14,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:14,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:14,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:42:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:14,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:42:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:14,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:42:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:14,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:42:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:14,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:42:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:14,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:42:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:14,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:42:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:14,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:42:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:14,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:42:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:14,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:42:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:14,789 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-11 20:42:14,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:14,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739617046] [2024-11-11 20:42:14,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739617046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:42:14,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:42:14,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:42:14,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971659249] [2024-11-11 20:42:14,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:42:14,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:42:14,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:14,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:42:14,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:42:14,791 INFO L87 Difference]: Start difference. First operand 685 states and 1115 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:15,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:15,764 INFO L93 Difference]: Finished difference Result 1703 states and 2838 transitions. [2024-11-11 20:42:15,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:42:15,765 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2024-11-11 20:42:15,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:15,770 INFO L225 Difference]: With dead ends: 1703 [2024-11-11 20:42:15,771 INFO L226 Difference]: Without dead ends: 1096 [2024-11-11 20:42:15,773 INFO L434 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-11 20:42:15,773 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 1029 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:42:15,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 820 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 20:42:15,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2024-11-11 20:42:15,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 985. [2024-11-11 20:42:15,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 777 states have (on average 1.5945945945945945) internal successors, (1239), 783 states have internal predecessors, (1239), 185 states have call successors, (185), 19 states have call predecessors, (185), 22 states have return successors, (214), 182 states have call predecessors, (214), 182 states have call successors, (214) [2024-11-11 20:42:15,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1638 transitions. [2024-11-11 20:42:15,830 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1638 transitions. Word has length 123 [2024-11-11 20:42:15,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:42:15,831 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1638 transitions. [2024-11-11 20:42:15,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:15,831 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1638 transitions. [2024-11-11 20:42:15,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-11 20:42:15,835 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:42:15,835 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:42:15,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:42:15,836 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:42:15,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:42:15,836 INFO L85 PathProgramCache]: Analyzing trace with hash -204325589, now seen corresponding path program 1 times [2024-11-11 20:42:15,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:42:15,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429778627] [2024-11-11 20:42:15,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:15,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:15,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:15,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:15,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:15,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:42:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:15,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:42:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:15,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:42:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:15,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:42:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:15,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:42:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:15,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:42:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:15,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:42:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:15,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:42:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:15,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:42:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:15,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:42:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:15,940 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-11 20:42:15,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:15,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429778627] [2024-11-11 20:42:15,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429778627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:42:15,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:42:15,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:42:15,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292501531] [2024-11-11 20:42:15,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:42:15,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:42:15,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:15,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:42:15,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:42:15,944 INFO L87 Difference]: Start difference. First operand 985 states and 1638 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:16,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:16,802 INFO L93 Difference]: Finished difference Result 2443 states and 4118 transitions. [2024-11-11 20:42:16,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:42:16,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2024-11-11 20:42:16,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:16,810 INFO L225 Difference]: With dead ends: 2443 [2024-11-11 20:42:16,810 INFO L226 Difference]: Without dead ends: 1589 [2024-11-11 20:42:16,814 INFO L434 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-11 20:42:16,815 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 1027 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:42:16,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 810 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:42:16,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2024-11-11 20:42:16,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1478. [2024-11-11 20:42:16,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1478 states, 1175 states have (on average 1.6008510638297873) internal successors, (1881), 1181 states have internal predecessors, (1881), 280 states have call successors, (280), 19 states have call predecessors, (280), 22 states have return successors, (309), 277 states have call predecessors, (309), 277 states have call successors, (309) [2024-11-11 20:42:16,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 2470 transitions. [2024-11-11 20:42:16,893 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 2470 transitions. Word has length 124 [2024-11-11 20:42:16,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:42:16,894 INFO L471 AbstractCegarLoop]: Abstraction has 1478 states and 2470 transitions. [2024-11-11 20:42:16,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:16,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 2470 transitions. [2024-11-11 20:42:16,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-11 20:42:16,899 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:42:16,899 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:42:16,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:42:16,900 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:42:16,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:42:16,900 INFO L85 PathProgramCache]: Analyzing trace with hash 716335858, now seen corresponding path program 1 times [2024-11-11 20:42:16,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:42:16,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366099342] [2024-11-11 20:42:16,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:16,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:16,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:16,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:16,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:16,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:42:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:16,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:42:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:16,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:42:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:16,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:42:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:16,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:42:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:16,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:42:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:16,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:42:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:16,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:42:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:16,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:42:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:16,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:42:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:17,000 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-11 20:42:17,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:17,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366099342] [2024-11-11 20:42:17,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366099342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:42:17,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:42:17,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:42:17,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392683457] [2024-11-11 20:42:17,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:42:17,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:42:17,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:17,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:42:17,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:42:17,002 INFO L87 Difference]: Start difference. First operand 1478 states and 2470 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:17,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:17,859 INFO L93 Difference]: Finished difference Result 3545 states and 6036 transitions. [2024-11-11 20:42:17,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:42:17,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2024-11-11 20:42:17,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:17,871 INFO L225 Difference]: With dead ends: 3545 [2024-11-11 20:42:17,871 INFO L226 Difference]: Without dead ends: 2333 [2024-11-11 20:42:17,875 INFO L434 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-11 20:42:17,876 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 1026 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:42:17,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 804 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:42:17,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2333 states. [2024-11-11 20:42:17,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2333 to 2222. [2024-11-11 20:42:17,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2222 states, 1796 states have (on average 1.6057906458797326) internal successors, (2884), 1802 states have internal predecessors, (2884), 403 states have call successors, (403), 19 states have call predecessors, (403), 22 states have return successors, (448), 400 states have call predecessors, (448), 400 states have call successors, (448) [2024-11-11 20:42:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 3735 transitions. [2024-11-11 20:42:17,989 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 3735 transitions. Word has length 125 [2024-11-11 20:42:17,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:42:17,990 INFO L471 AbstractCegarLoop]: Abstraction has 2222 states and 3735 transitions. [2024-11-11 20:42:17,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:17,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 3735 transitions. [2024-11-11 20:42:17,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-11 20:42:17,997 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:42:17,997 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:42:17,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 20:42:17,998 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:42:17,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:42:17,998 INFO L85 PathProgramCache]: Analyzing trace with hash -501836820, now seen corresponding path program 1 times [2024-11-11 20:42:17,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:42:17,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043314628] [2024-11-11 20:42:17,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:17,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:18,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:18,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:18,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:18,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:42:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:18,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:42:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:18,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:42:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:18,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:42:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:18,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:42:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:18,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:42:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:18,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:42:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:18,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:42:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:18,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:42:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:18,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:42:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:18,086 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-11 20:42:18,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:18,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043314628] [2024-11-11 20:42:18,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043314628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:42:18,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:42:18,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:42:18,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278359066] [2024-11-11 20:42:18,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:42:18,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:42:18,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:18,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:42:18,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:42:18,088 INFO L87 Difference]: Start difference. First operand 2222 states and 3735 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:19,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:19,037 INFO L93 Difference]: Finished difference Result 5254 states and 9016 transitions. [2024-11-11 20:42:19,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:42:19,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2024-11-11 20:42:19,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:19,052 INFO L225 Difference]: With dead ends: 5254 [2024-11-11 20:42:19,053 INFO L226 Difference]: Without dead ends: 3517 [2024-11-11 20:42:19,057 INFO L434 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-11 20:42:19,058 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 1024 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:42:19,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 804 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 20:42:19,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3517 states. [2024-11-11 20:42:19,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3517 to 3406. [2024-11-11 20:42:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3406 states, 2801 states have (on average 1.608711174580507) internal successors, (4506), 2807 states have internal predecessors, (4506), 582 states have call successors, (582), 19 states have call predecessors, (582), 22 states have return successors, (653), 579 states have call predecessors, (653), 579 states have call successors, (653) [2024-11-11 20:42:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3406 states to 3406 states and 5741 transitions. [2024-11-11 20:42:19,159 INFO L78 Accepts]: Start accepts. Automaton has 3406 states and 5741 transitions. Word has length 126 [2024-11-11 20:42:19,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:42:19,160 INFO L471 AbstractCegarLoop]: Abstraction has 3406 states and 5741 transitions. [2024-11-11 20:42:19,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:19,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3406 states and 5741 transitions. [2024-11-11 20:42:19,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-11 20:42:19,168 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:42:19,168 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:42:19,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:42:19,169 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:42:19,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:42:19,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1761026382, now seen corresponding path program 1 times [2024-11-11 20:42:19,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:42:19,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780418940] [2024-11-11 20:42:19,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:19,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:19,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:19,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:19,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:19,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:42:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:19,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:42:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:19,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:42:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:19,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:42:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:19,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:42:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:19,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:42:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:19,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:42:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:19,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:42:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:19,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:42:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:19,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 20:42:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:19,256 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-11 20:42:19,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:19,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780418940] [2024-11-11 20:42:19,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780418940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:42:19,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:42:19,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:42:19,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593096918] [2024-11-11 20:42:19,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:42:19,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:42:19,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:19,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:42:19,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:42:19,258 INFO L87 Difference]: Start difference. First operand 3406 states and 5741 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:20,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:20,234 INFO L93 Difference]: Finished difference Result 8327 states and 14332 transitions. [2024-11-11 20:42:20,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:42:20,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2024-11-11 20:42:20,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:20,261 INFO L225 Difference]: With dead ends: 8327 [2024-11-11 20:42:20,261 INFO L226 Difference]: Without dead ends: 5658 [2024-11-11 20:42:20,271 INFO L434 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-11 20:42:20,272 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 1022 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:42:20,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 827 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:42:20,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5658 states. [2024-11-11 20:42:20,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5658 to 5547. [2024-11-11 20:42:20,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5547 states, 4566 states have (on average 1.6014016644765658) internal successors, (7312), 4572 states have internal predecessors, (7312), 958 states have call successors, (958), 19 states have call predecessors, (958), 22 states have return successors, (1073), 955 states have call predecessors, (1073), 955 states have call successors, (1073) [2024-11-11 20:42:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5547 states to 5547 states and 9343 transitions. [2024-11-11 20:42:20,476 INFO L78 Accepts]: Start accepts. Automaton has 5547 states and 9343 transitions. Word has length 127 [2024-11-11 20:42:20,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:42:20,476 INFO L471 AbstractCegarLoop]: Abstraction has 5547 states and 9343 transitions. [2024-11-11 20:42:20,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:20,476 INFO L276 IsEmpty]: Start isEmpty. Operand 5547 states and 9343 transitions. [2024-11-11 20:42:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-11 20:42:20,489 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:42:20,489 INFO L218 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] [2024-11-11 20:42:20,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 20:42:20,489 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:42:20,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:42:20,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1060416112, now seen corresponding path program 1 times [2024-11-11 20:42:20,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:42:20,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468449038] [2024-11-11 20:42:20,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:20,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:20,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:20,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:20,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:20,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:42:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:20,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:42:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:20,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:42:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:20,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:42:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:20,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:42:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:20,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:42:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:20,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:42:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:20,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:42:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:20,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:42:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:20,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 20:42:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:20,578 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-11 20:42:20,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:20,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468449038] [2024-11-11 20:42:20,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468449038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:42:20,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:42:20,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:42:20,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688853831] [2024-11-11 20:42:20,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:42:20,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:42:20,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:20,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:42:20,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:42:20,579 INFO L87 Difference]: Start difference. First operand 5547 states and 9343 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:21,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:21,541 INFO L93 Difference]: Finished difference Result 13749 states and 23633 transitions. [2024-11-11 20:42:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:42:21,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2024-11-11 20:42:21,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:21,586 INFO L225 Difference]: With dead ends: 13749 [2024-11-11 20:42:21,586 INFO L226 Difference]: Without dead ends: 9341 [2024-11-11 20:42:21,601 INFO L434 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-11 20:42:21,602 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1019 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:42:21,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 809 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:42:21,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9341 states. [2024-11-11 20:42:21,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9341 to 9230. [2024-11-11 20:42:21,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9230 states, 7643 states have (on average 1.5987177809760564) internal successors, (12219), 7649 states have internal predecessors, (12219), 1564 states have call successors, (1564), 19 states have call predecessors, (1564), 22 states have return successors, (1757), 1561 states have call predecessors, (1757), 1561 states have call successors, (1757) [2024-11-11 20:42:21,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9230 states to 9230 states and 15540 transitions. [2024-11-11 20:42:21,921 INFO L78 Accepts]: Start accepts. Automaton has 9230 states and 15540 transitions. Word has length 128 [2024-11-11 20:42:21,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:42:21,922 INFO L471 AbstractCegarLoop]: Abstraction has 9230 states and 15540 transitions. [2024-11-11 20:42:21,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:21,923 INFO L276 IsEmpty]: Start isEmpty. Operand 9230 states and 15540 transitions. [2024-11-11 20:42:21,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-11 20:42:21,940 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:42:21,940 INFO L218 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] [2024-11-11 20:42:21,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 20:42:21,941 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:42:21,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:42:21,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1511204592, now seen corresponding path program 1 times [2024-11-11 20:42:21,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:42:21,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377629949] [2024-11-11 20:42:21,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:21,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:21,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:21,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:21,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:22,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:42:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:22,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:42:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:22,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:42:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:22,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:42:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:22,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:42:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:22,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:42:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:22,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:42:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:22,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:42:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:22,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:42:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:22,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 20:42:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:22,029 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-11 20:42:22,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:22,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377629949] [2024-11-11 20:42:22,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377629949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:42:22,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:42:22,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:42:22,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567089767] [2024-11-11 20:42:22,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:42:22,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:42:22,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:22,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:42:22,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:42:22,032 INFO L87 Difference]: Start difference. First operand 9230 states and 15540 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:23,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:23,182 INFO L93 Difference]: Finished difference Result 23933 states and 41074 transitions. [2024-11-11 20:42:23,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:42:23,185 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2024-11-11 20:42:23,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:23,233 INFO L225 Difference]: With dead ends: 23933 [2024-11-11 20:42:23,233 INFO L226 Difference]: Without dead ends: 16294 [2024-11-11 20:42:23,251 INFO L434 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-11 20:42:23,251 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1017 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:42:23,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 850 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:42:23,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16294 states. [2024-11-11 20:42:23,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16294 to 16183. [2024-11-11 20:42:23,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16183 states, 13393 states have (on average 1.5895617113417457) internal successors, (21289), 13399 states have internal predecessors, (21289), 2767 states have call successors, (2767), 19 states have call predecessors, (2767), 22 states have return successors, (3104), 2764 states have call predecessors, (3104), 2764 states have call successors, (3104) [2024-11-11 20:42:23,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16183 states to 16183 states and 27160 transitions. [2024-11-11 20:42:23,731 INFO L78 Accepts]: Start accepts. Automaton has 16183 states and 27160 transitions. Word has length 129 [2024-11-11 20:42:23,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:42:23,732 INFO L471 AbstractCegarLoop]: Abstraction has 16183 states and 27160 transitions. [2024-11-11 20:42:23,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:23,732 INFO L276 IsEmpty]: Start isEmpty. Operand 16183 states and 27160 transitions. [2024-11-11 20:42:23,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-11 20:42:23,753 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:42:23,754 INFO L218 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] [2024-11-11 20:42:23,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 20:42:23,754 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:42:23,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:42:23,755 INFO L85 PathProgramCache]: Analyzing trace with hash -621266959, now seen corresponding path program 1 times [2024-11-11 20:42:23,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:42:23,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664000715] [2024-11-11 20:42:23,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:23,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:23,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:23,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:23,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:23,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:42:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:23,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:42:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:23,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:42:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:23,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:42:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:23,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:42:23,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:23,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:42:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:23,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:42:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:23,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:42:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:23,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:42:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:23,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-11 20:42:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:23,841 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-11 20:42:23,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:23,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664000715] [2024-11-11 20:42:23,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664000715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:42:23,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:42:23,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:42:23,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974026186] [2024-11-11 20:42:23,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:42:23,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:42:23,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:23,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:42:23,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:42:23,844 INFO L87 Difference]: Start difference. First operand 16183 states and 27160 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:25,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:25,448 INFO L93 Difference]: Finished difference Result 42899 states and 73471 transitions. [2024-11-11 20:42:25,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:42:25,449 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 130 [2024-11-11 20:42:25,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:25,639 INFO L225 Difference]: With dead ends: 42899 [2024-11-11 20:42:25,639 INFO L226 Difference]: Without dead ends: 28949 [2024-11-11 20:42:25,690 INFO L434 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-11 20:42:25,691 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1015 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:42:25,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 806 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:42:25,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28949 states. [2024-11-11 20:42:26,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28949 to 28838. [2024-11-11 20:42:26,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28838 states, 24009 states have (on average 1.585072264567454) internal successors, (38056), 24015 states have internal predecessors, (38056), 4806 states have call successors, (4806), 19 states have call predecessors, (4806), 22 states have return successors, (5417), 4803 states have call predecessors, (5417), 4803 states have call successors, (5417) [2024-11-11 20:42:26,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28838 states to 28838 states and 48279 transitions. [2024-11-11 20:42:26,577 INFO L78 Accepts]: Start accepts. Automaton has 28838 states and 48279 transitions. Word has length 130 [2024-11-11 20:42:26,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:42:26,579 INFO L471 AbstractCegarLoop]: Abstraction has 28838 states and 48279 transitions. [2024-11-11 20:42:26,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:26,579 INFO L276 IsEmpty]: Start isEmpty. Operand 28838 states and 48279 transitions. [2024-11-11 20:42:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-11 20:42:26,606 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:42:26,606 INFO L218 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] [2024-11-11 20:42:26,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 20:42:26,606 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:42:26,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:42:26,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1441707250, now seen corresponding path program 1 times [2024-11-11 20:42:26,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:42:26,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307472996] [2024-11-11 20:42:26,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:26,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:26,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:26,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:26,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:26,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:42:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:26,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:42:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:26,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:42:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:26,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:42:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:26,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:42:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:26,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:42:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:26,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:42:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:26,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:42:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:26,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:42:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:26,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 20:42:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:26,694 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-11 20:42:26,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:26,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307472996] [2024-11-11 20:42:26,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307472996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:42:26,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:42:26,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:42:26,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541040951] [2024-11-11 20:42:26,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:42:26,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:42:26,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:26,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:42:26,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:42:26,696 INFO L87 Difference]: Start difference. First operand 28838 states and 48279 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:28,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:28,906 INFO L93 Difference]: Finished difference Result 78661 states and 133835 transitions. [2024-11-11 20:42:28,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:42:28,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 131 [2024-11-11 20:42:28,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:29,094 INFO L225 Difference]: With dead ends: 78661 [2024-11-11 20:42:29,095 INFO L226 Difference]: Without dead ends: 52828 [2024-11-11 20:42:29,161 INFO L434 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-11 20:42:29,161 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 1013 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:42:29,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 811 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 20:42:29,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52828 states. [2024-11-11 20:42:30,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52828 to 52717. [2024-11-11 20:42:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52717 states, 44173 states have (on average 1.5792226020419713) internal successors, (69759), 44179 states have internal predecessors, (69759), 8521 states have call successors, (8521), 19 states have call predecessors, (8521), 22 states have return successors, (9664), 8518 states have call predecessors, (9664), 8518 states have call successors, (9664) [2024-11-11 20:42:31,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52717 states to 52717 states and 87944 transitions. [2024-11-11 20:42:31,125 INFO L78 Accepts]: Start accepts. Automaton has 52717 states and 87944 transitions. Word has length 131 [2024-11-11 20:42:31,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:42:31,126 INFO L471 AbstractCegarLoop]: Abstraction has 52717 states and 87944 transitions. [2024-11-11 20:42:31,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:31,126 INFO L276 IsEmpty]: Start isEmpty. Operand 52717 states and 87944 transitions. [2024-11-11 20:42:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-11 20:42:31,158 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:42:31,159 INFO L218 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-11 20:42:31,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 20:42:31,159 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:42:31,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:42:31,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1682493839, now seen corresponding path program 1 times [2024-11-11 20:42:31,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:42:31,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509733982] [2024-11-11 20:42:31,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:31,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:31,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:31,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:31,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:31,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:42:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:31,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:42:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:31,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:42:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:31,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:42:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:31,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:42:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:31,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:42:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:31,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:42:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:31,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:42:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:31,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:42:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:31,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:42:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:31,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-11 20:42:31,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:31,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509733982] [2024-11-11 20:42:31,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509733982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:42:31,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:42:31,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:42:31,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953393258] [2024-11-11 20:42:31,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:42:31,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:42:31,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:31,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:42:31,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:42:31,564 INFO L87 Difference]: Start difference. First operand 52717 states and 87944 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:34,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:34,128 INFO L93 Difference]: Finished difference Result 98432 states and 167765 transitions. [2024-11-11 20:42:34,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:42:34,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 132 [2024-11-11 20:42:34,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:34,449 INFO L225 Difference]: With dead ends: 98432 [2024-11-11 20:42:34,449 INFO L226 Difference]: Without dead ends: 98287 [2024-11-11 20:42:34,495 INFO L434 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-11 20:42:34,496 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 1008 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:42:34,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 843 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:42:34,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98287 states. [2024-11-11 20:42:37,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98287 to 98176. [2024-11-11 20:42:37,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98176 states, 82833 states have (on average 1.5719097461156786) internal successors, (130206), 82839 states have internal predecessors, (130206), 15320 states have call successors, (15320), 19 states have call predecessors, (15320), 22 states have return successors, (17509), 15317 states have call predecessors, (17509), 15317 states have call successors, (17509) [2024-11-11 20:42:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98176 states to 98176 states and 163035 transitions. [2024-11-11 20:42:37,862 INFO L78 Accepts]: Start accepts. Automaton has 98176 states and 163035 transitions. Word has length 132 [2024-11-11 20:42:37,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:42:37,862 INFO L471 AbstractCegarLoop]: Abstraction has 98176 states and 163035 transitions. [2024-11-11 20:42:37,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:42:37,862 INFO L276 IsEmpty]: Start isEmpty. Operand 98176 states and 163035 transitions. [2024-11-11 20:42:37,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-11 20:42:37,893 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:42:37,893 INFO L218 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-11 20:42:37,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 20:42:37,893 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:42:37,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:42:37,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1960358417, now seen corresponding path program 1 times [2024-11-11 20:42:37,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:42:37,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111430231] [2024-11-11 20:42:37,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:37,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:38,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:38,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:38,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:38,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:42:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:38,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:42:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:38,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:42:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:38,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:42:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:38,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:42:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:38,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:42:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:38,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:42:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:38,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:42:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:38,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 20:42:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:38,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 20:42:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:38,071 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-11 20:42:38,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:38,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111430231] [2024-11-11 20:42:38,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111430231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:42:38,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:42:38,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 20:42:38,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261822215] [2024-11-11 20:42:38,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:42:38,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:42:38,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:38,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:42:38,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:42:38,073 INFO L87 Difference]: Start difference. First operand 98176 states and 163035 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:42:42,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:42,462 INFO L93 Difference]: Finished difference Result 98878 states and 167309 transitions. [2024-11-11 20:42:42,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-11 20:42:42,462 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 133 [2024-11-11 20:42:42,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:43,006 INFO L225 Difference]: With dead ends: 98878 [2024-11-11 20:42:43,007 INFO L226 Difference]: Without dead ends: 98739 [2024-11-11 20:42:43,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=328, Invalid=862, Unknown=0, NotChecked=0, Total=1190 [2024-11-11 20:42:43,044 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 1697 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 3579 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1711 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 4009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 3579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:42:43,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1711 Valid, 1138 Invalid, 4009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 3579 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-11 20:42:43,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98739 states. [2024-11-11 20:42:46,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98739 to 98458. [2024-11-11 20:42:46,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98458 states, 83059 states have (on average 1.5715575675122504) internal successors, (130532), 83068 states have internal predecessors, (130532), 15350 states have call successors, (15350), 41 states have call predecessors, (15350), 48 states have return successors, (17544), 15348 states have call predecessors, (17544), 15345 states have call successors, (17544) [2024-11-11 20:42:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98458 states to 98458 states and 163426 transitions. [2024-11-11 20:42:46,901 INFO L78 Accepts]: Start accepts. Automaton has 98458 states and 163426 transitions. Word has length 133 [2024-11-11 20:42:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:42:46,902 INFO L471 AbstractCegarLoop]: Abstraction has 98458 states and 163426 transitions. [2024-11-11 20:42:46,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:42:46,902 INFO L276 IsEmpty]: Start isEmpty. Operand 98458 states and 163426 transitions. [2024-11-11 20:42:46,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-11 20:42:46,935 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:42:46,935 INFO L218 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-11 20:42:46,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 20:42:46,936 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:42:46,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:42:46,936 INFO L85 PathProgramCache]: Analyzing trace with hash 390154637, now seen corresponding path program 1 times [2024-11-11 20:42:46,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:42:46,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035832706] [2024-11-11 20:42:46,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:46,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:47,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:47,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:47,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:47,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:42:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:47,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:42:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:47,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:42:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:47,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:42:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:47,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:42:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:47,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:42:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:47,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:42:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:47,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:42:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:47,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 20:42:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:47,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 20:42:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:47,182 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-11 20:42:47,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:47,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035832706] [2024-11-11 20:42:47,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035832706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:42:47,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:42:47,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-11 20:42:47,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547357558] [2024-11-11 20:42:47,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:42:47,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-11 20:42:47,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:47,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-11 20:42:47,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:42:47,183 INFO L87 Difference]: Start difference. First operand 98458 states and 163426 transitions. Second operand has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 10 states have internal predecessors, (92), 6 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-11 20:42:51,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:51,842 INFO L93 Difference]: Finished difference Result 99284 states and 167878 transitions. [2024-11-11 20:42:51,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-11 20:42:51,844 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 10 states have internal predecessors, (92), 6 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 134 [2024-11-11 20:42:51,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:52,199 INFO L225 Difference]: With dead ends: 99284 [2024-11-11 20:42:52,199 INFO L226 Difference]: Without dead ends: 98661 [2024-11-11 20:42:52,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=1636, Unknown=0, NotChecked=0, Total=1980 [2024-11-11 20:42:52,240 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 1381 mSDsluCounter, 1805 mSDsCounter, 0 mSdLazyCounter, 5260 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 1984 SdHoareTripleChecker+Invalid, 5681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 5260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:42:52,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 1984 Invalid, 5681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 5260 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-11 20:42:52,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98661 states. [2024-11-11 20:42:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98661 to 98431. [2024-11-11 20:42:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98431 states, 83037 states have (on average 1.5716126545997566) internal successors, (130502), 83046 states have internal predecessors, (130502), 15348 states have call successors, (15348), 40 states have call predecessors, (15348), 45 states have return successors, (17541), 15344 states have call predecessors, (17541), 15344 states have call successors, (17541) [2024-11-11 20:42:55,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98431 states to 98431 states and 163391 transitions. [2024-11-11 20:42:55,547 INFO L78 Accepts]: Start accepts. Automaton has 98431 states and 163391 transitions. Word has length 134 [2024-11-11 20:42:55,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:42:55,547 INFO L471 AbstractCegarLoop]: Abstraction has 98431 states and 163391 transitions. [2024-11-11 20:42:55,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 10 states have internal predecessors, (92), 6 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-11 20:42:55,548 INFO L276 IsEmpty]: Start isEmpty. Operand 98431 states and 163391 transitions. [2024-11-11 20:42:55,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-11 20:42:55,585 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:42:55,585 INFO L218 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-11 20:42:55,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 20:42:55,586 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:42:55,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:42:55,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1270695589, now seen corresponding path program 1 times [2024-11-11 20:42:55,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:42:55,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35220170] [2024-11-11 20:42:55,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:55,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:42:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:56,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:42:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:56,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:42:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:56,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:42:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:56,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:42:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:56,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:42:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:56,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:42:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:56,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:42:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:56,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:42:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:56,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:42:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:56,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:42:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:56,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:42:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:56,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 20:42:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:56,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 20:42:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:56,368 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-11 20:42:56,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:42:56,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35220170] [2024-11-11 20:42:56,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35220170] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:42:56,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807817857] [2024-11-11 20:42:56,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:42:56,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:42:56,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:42:56,370 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:42:56,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 20:42:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:42:56,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-11 20:42:56,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:42:56,882 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 20:42:56,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:42:56,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807817857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:42:56,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:42:56,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [20] total 31 [2024-11-11 20:42:56,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564668893] [2024-11-11 20:42:56,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:42:56,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 20:42:56,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:42:56,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 20:42:56,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=857, Unknown=0, NotChecked=0, Total=930 [2024-11-11 20:42:56,883 INFO L87 Difference]: Start difference. First operand 98431 states and 163391 transitions. Second operand has 13 states, 12 states have (on average 8.5) internal successors, (102), 11 states have internal predecessors, (102), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-11 20:42:59,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:42:59,088 INFO L93 Difference]: Finished difference Result 99076 states and 164277 transitions. [2024-11-11 20:42:59,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 20:42:59,088 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.5) internal successors, (102), 11 states have internal predecessors, (102), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) Word has length 137 [2024-11-11 20:42:59,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:42:59,406 INFO L225 Difference]: With dead ends: 99076 [2024-11-11 20:42:59,406 INFO L226 Difference]: Without dead ends: 98913 [2024-11-11 20:42:59,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=1870, Unknown=0, NotChecked=0, Total=2070 [2024-11-11 20:42:59,450 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 699 mSDsluCounter, 4090 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 4538 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:42:59,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 4538 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:42:59,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98913 states. [2024-11-11 20:43:02,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98913 to 98839. [2024-11-11 20:43:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98839 states, 83357 states have (on average 1.5710738150365295) internal successors, (130960), 83376 states have internal predecessors, (130960), 15397 states have call successors, (15397), 70 states have call predecessors, (15397), 84 states have return successors, (17604), 15392 states have call predecessors, (17604), 15391 states have call successors, (17604) [2024-11-11 20:43:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98839 states to 98839 states and 163961 transitions. [2024-11-11 20:43:03,188 INFO L78 Accepts]: Start accepts. Automaton has 98839 states and 163961 transitions. Word has length 137 [2024-11-11 20:43:03,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:43:03,188 INFO L471 AbstractCegarLoop]: Abstraction has 98839 states and 163961 transitions. [2024-11-11 20:43:03,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.5) internal successors, (102), 11 states have internal predecessors, (102), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-11 20:43:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 98839 states and 163961 transitions. [2024-11-11 20:43:03,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-11 20:43:03,224 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:43:03,224 INFO L218 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-11 20:43:03,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-11 20:43:03,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:43:03,424 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:43:03,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:43:03,425 INFO L85 PathProgramCache]: Analyzing trace with hash 252466570, now seen corresponding path program 1 times [2024-11-11 20:43:03,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:43:03,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510496920] [2024-11-11 20:43:03,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:03,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:43:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:03,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:43:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:03,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:43:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:03,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:43:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:03,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:43:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:03,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:43:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:03,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:43:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:03,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:43:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:03,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:43:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:03,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:43:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:03,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:43:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:03,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:43:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:03,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 20:43:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:03,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 20:43:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:03,944 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 20:43:03,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:43:03,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510496920] [2024-11-11 20:43:03,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510496920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:43:03,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779791201] [2024-11-11 20:43:03,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:43:03,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:43:03,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:43:03,946 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:43:03,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-11 20:43:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:43:04,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-11 20:43:04,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:43:05,103 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:43:05,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:43:05,689 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-11 20:43:05,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779791201] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:43:05,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:43:05,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 18] total 53 [2024-11-11 20:43:05,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654417569] [2024-11-11 20:43:05,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:43:05,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-11 20:43:05,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:43:05,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-11 20:43:05,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2578, Unknown=0, NotChecked=0, Total=2756 [2024-11-11 20:43:05,692 INFO L87 Difference]: Start difference. First operand 98839 states and 163961 transitions. Second operand has 53 states, 44 states have (on average 6.25) internal successors, (275), 46 states have internal predecessors, (275), 16 states have call successors, (46), 13 states have call predecessors, (46), 18 states have return successors, (39), 10 states have call predecessors, (39), 15 states have call successors, (39)