./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec7_product28.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_spec7_product28.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 f29cc89d3ee64e709bcde3f8f1e5c1c29a2d05992b7eca470a9d177af894449a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:47:36,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:47:37,043 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:47:37,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:47:37,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:47:37,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:47:37,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:47:37,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:47:37,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:47:37,081 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:47:37,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:47:37,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:47:37,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:47:37,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:47:37,084 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:47:37,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:47:37,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:47:37,084 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:47:37,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:47:37,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:47:37,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:47:37,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:47:37,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:47:37,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:47:37,089 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:47:37,089 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:47:37,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:47:37,089 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:47:37,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:47:37,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:47:37,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:47:37,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:47:37,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:47:37,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:47:37,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:47:37,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:47:37,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:47:37,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:47:37,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:47:37,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:47:37,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:47:37,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:47:37,092 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 -> f29cc89d3ee64e709bcde3f8f1e5c1c29a2d05992b7eca470a9d177af894449a [2024-11-11 20:47:37,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:47:37,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:47:37,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:47:37,322 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:47:37,322 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:47:37,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec7_product28.cil.c [2024-11-11 20:47:38,847 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:47:39,203 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:47:39,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product28.cil.c [2024-11-11 20:47:39,229 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83e33af29/805d49c442194b5d8fce9ec64dd9dbc3/FLAG900cc2ce0 [2024-11-11 20:47:39,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83e33af29/805d49c442194b5d8fce9ec64dd9dbc3 [2024-11-11 20:47:39,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:47:39,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:47:39,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:47:39,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:47:39,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:47:39,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:47:39" (1/1) ... [2024-11-11 20:47:39,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@599c30b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:47:39, skipping insertion in model container [2024-11-11 20:47:39,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:47:39" (1/1) ... [2024-11-11 20:47:39,313 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:47:39,490 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product28.cil.c[1542,1555] [2024-11-11 20:47:39,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:47:39,814 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:47:39,822 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2024-11-11 20:47:39,824 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [57] [2024-11-11 20:47:39,824 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [217] [2024-11-11 20:47:39,824 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [255] [2024-11-11 20:47:39,824 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [591] [2024-11-11 20:47:39,824 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [871] [2024-11-11 20:47:39,825 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptVerify_spec.i","") [1084] [2024-11-11 20:47:39,825 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1102] [2024-11-11 20:47:39,825 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1468] [2024-11-11 20:47:39,825 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1485] [2024-11-11 20:47:39,826 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2554] [2024-11-11 20:47:39,834 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product28.cil.c[1542,1555] [2024-11-11 20:47:39,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:47:39,961 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:47:39,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:47:39 WrapperNode [2024-11-11 20:47:39,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:47:39,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:47:39,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:47:39,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:47:39,968 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:47:39" (1/1) ... [2024-11-11 20:47:39,987 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:47:39" (1/1) ... [2024-11-11 20:47:40,030 INFO L138 Inliner]: procedures = 128, calls = 195, calls flagged for inlining = 55, calls inlined = 45, statements flattened = 845 [2024-11-11 20:47:40,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:47:40,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:47:40,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:47:40,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:47:40,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:47:39" (1/1) ... [2024-11-11 20:47:40,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:47:39" (1/1) ... [2024-11-11 20:47:40,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:47:39" (1/1) ... [2024-11-11 20:47:40,064 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:47:40,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:47:39" (1/1) ... [2024-11-11 20:47:40,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:47:39" (1/1) ... [2024-11-11 20:47:40,077 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:47:39" (1/1) ... [2024-11-11 20:47:40,086 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:47:39" (1/1) ... [2024-11-11 20:47:40,089 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:47:39" (1/1) ... [2024-11-11 20:47:40,091 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:47:39" (1/1) ... [2024-11-11 20:47:40,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:47:40,096 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:47:40,097 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:47:40,097 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:47:40,097 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:47:39" (1/1) ... [2024-11-11 20:47:40,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:47:40,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:47:40,151 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:47:40,156 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:47:40,191 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-11-11 20:47:40,191 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-11-11 20:47:40,191 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-11-11 20:47:40,191 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-11-11 20:47:40,191 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-11-11 20:47:40,191 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-11-11 20:47:40,191 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-11 20:47:40,192 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-11 20:47:40,192 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-11 20:47:40,192 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-11 20:47:40,192 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-11 20:47:40,192 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-11 20:47:40,192 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-11 20:47:40,192 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-11 20:47:40,192 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-11-11 20:47:40,192 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-11-11 20:47:40,193 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-11 20:47:40,193 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-11 20:47:40,193 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-11 20:47:40,193 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-11 20:47:40,193 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-11 20:47:40,193 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-11 20:47:40,193 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-11 20:47:40,193 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-11 20:47:40,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:47:40,194 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-11 20:47:40,194 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-11 20:47:40,194 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-11-11 20:47:40,194 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-11-11 20:47:40,194 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-11 20:47:40,194 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-11 20:47:40,194 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-11 20:47:40,194 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-11 20:47:40,194 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-11 20:47:40,194 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-11 20:47:40,195 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-11-11 20:47:40,195 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-11-11 20:47:40,195 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-11 20:47:40,195 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-11 20:47:40,195 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-11-11 20:47:40,195 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-11-11 20:47:40,195 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-11 20:47:40,195 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-11 20:47:40,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:47:40,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:47:40,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:47:40,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:47:40,196 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-11 20:47:40,196 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-11 20:47:40,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:47:40,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:47:40,468 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:47:40,470 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:47:41,028 INFO L? ?]: Removed 395 outVars from TransFormulas that were not future-live. [2024-11-11 20:47:41,029 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:47:41,047 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:47:41,047 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:47:41,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:47:41 BoogieIcfgContainer [2024-11-11 20:47:41,048 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:47:41,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:47:41,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:47:41,052 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:47:41,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:47:39" (1/3) ... [2024-11-11 20:47:41,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a163b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:47:41, skipping insertion in model container [2024-11-11 20:47:41,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:47:39" (2/3) ... [2024-11-11 20:47:41,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a163b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:47:41, skipping insertion in model container [2024-11-11 20:47:41,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:47:41" (3/3) ... [2024-11-11 20:47:41,055 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec7_product28.cil.c [2024-11-11 20:47:41,067 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:47:41,067 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:47:41,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:47:41,198 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;@309979c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:47:41,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:47:41,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 324 states, 251 states have (on average 1.5219123505976095) internal successors, (382), 255 states have internal predecessors, (382), 49 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-11 20:47:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-11 20:47:41,221 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:47:41,222 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:47:41,222 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:47:41,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:47:41,227 INFO L85 PathProgramCache]: Analyzing trace with hash 331182671, now seen corresponding path program 1 times [2024-11-11 20:47:41,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:47:41,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198691289] [2024-11-11 20:47:41,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:47:41,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:47:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:41,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:47:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:41,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:47:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:41,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:47:41,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:41,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:47:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:41,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:47:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:41,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:47:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:41,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:47:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:47:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:47:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:47:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:47:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:47:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:47:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:47:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:47:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,055 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:47:42,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:47:42,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198691289] [2024-11-11 20:47:42,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198691289] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:47:42,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980504703] [2024-11-11 20:47:42,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:47:42,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:47:42,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:47:42,064 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:47:42,066 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:47:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 20:47:42,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:47:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-11 20:47:42,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:47:42,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980504703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:47:42,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:47:42,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-11-11 20:47:42,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285624341] [2024-11-11 20:47:42,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:47:42,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:47:42,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:47:42,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:47:42,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:47:42,360 INFO L87 Difference]: Start difference. First operand has 324 states, 251 states have (on average 1.5219123505976095) internal successors, (382), 255 states have internal predecessors, (382), 49 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:47:42,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:47:42,398 INFO L93 Difference]: Finished difference Result 499 states and 722 transitions. [2024-11-11 20:47:42,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:47:42,401 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 117 [2024-11-11 20:47:42,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:47:42,412 INFO L225 Difference]: With dead ends: 499 [2024-11-11 20:47:42,412 INFO L226 Difference]: Without dead ends: 317 [2024-11-11 20:47:42,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:47:42,418 INFO L435 NwaCegarLoop]: 476 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, 476 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:47:42,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:47:42,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-11 20:47:42,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2024-11-11 20:47:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 245 states have (on average 1.5142857142857142) internal successors, (371), 248 states have internal predecessors, (371), 49 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-11 20:47:42,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 468 transitions. [2024-11-11 20:47:42,481 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 468 transitions. Word has length 117 [2024-11-11 20:47:42,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:47:42,482 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 468 transitions. [2024-11-11 20:47:42,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:47:42,483 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 468 transitions. [2024-11-11 20:47:42,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-11 20:47:42,487 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:47:42,487 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:47:42,502 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:47:42,688 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:47:42,689 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:47:42,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:47:42,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1049878184, now seen corresponding path program 1 times [2024-11-11 20:47:42,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:47:42,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954840548] [2024-11-11 20:47:42,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:47:42,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:47:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:47:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:47:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:47:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:47:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:47:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:47:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:47:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:47:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:47:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:47:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:47:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:47:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:47:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:47:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:47:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:42,981 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:47:42,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:47:42,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954840548] [2024-11-11 20:47:42,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954840548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:47:42,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39731276] [2024-11-11 20:47:42,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:47:42,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:47:42,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:47:42,987 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:47:42,994 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:47:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:43,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 20:47:43,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:47:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-11 20:47:43,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:47:43,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39731276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:47:43,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:47:43,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-11 20:47:43,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318615881] [2024-11-11 20:47:43,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:47:43,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:47:43,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:47:43,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:47:43,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:47:43,339 INFO L87 Difference]: Start difference. First operand 317 states and 468 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:47:43,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:47:43,418 INFO L93 Difference]: Finished difference Result 489 states and 703 transitions. [2024-11-11 20:47:43,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:47:43,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 118 [2024-11-11 20:47:43,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:47:43,429 INFO L225 Difference]: With dead ends: 489 [2024-11-11 20:47:43,429 INFO L226 Difference]: Without dead ends: 320 [2024-11-11 20:47:43,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:47:43,438 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 1 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 930 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:47:43,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 930 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:47:43,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-11 20:47:43,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 319. [2024-11-11 20:47:43,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 247 states have (on average 1.5101214574898785) internal successors, (373), 250 states have internal predecessors, (373), 49 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-11 20:47:43,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 470 transitions. [2024-11-11 20:47:43,487 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 470 transitions. Word has length 118 [2024-11-11 20:47:43,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:47:43,488 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 470 transitions. [2024-11-11 20:47:43,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:47:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 470 transitions. [2024-11-11 20:47:43,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-11 20:47:43,491 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:47:43,494 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:47:43,511 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:47:43,695 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:47:43,699 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:47:43,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:47:43,700 INFO L85 PathProgramCache]: Analyzing trace with hash -584714191, now seen corresponding path program 1 times [2024-11-11 20:47:43,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:47:43,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498610824] [2024-11-11 20:47:43,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:47:43,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:47:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:43,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:47:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:43,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:47:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:43,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:47:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:47:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:47:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:47:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 20:47:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 20:47:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:47:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:47:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:47:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:47:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:47:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:47:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:47:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,047 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-11 20:47:44,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:47:44,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498610824] [2024-11-11 20:47:44,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498610824] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:47:44,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913269190] [2024-11-11 20:47:44,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:47:44,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:47:44,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:47:44,050 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:47:44,053 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:47:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 1055 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:47:44,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:47:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-11 20:47:44,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:47:44,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913269190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:47:44,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:47:44,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-11 20:47:44,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937806384] [2024-11-11 20:47:44,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:47:44,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:47:44,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:47:44,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:47:44,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:47:44,305 INFO L87 Difference]: Start difference. First operand 319 states and 470 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:47:44,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:47:44,338 INFO L93 Difference]: Finished difference Result 663 states and 991 transitions. [2024-11-11 20:47:44,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:47:44,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-11 20:47:44,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:47:44,342 INFO L225 Difference]: With dead ends: 663 [2024-11-11 20:47:44,342 INFO L226 Difference]: Without dead ends: 371 [2024-11-11 20:47:44,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 150 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:47:44,347 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 99 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 905 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:47:44,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 905 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:47:44,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-11 20:47:44,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2024-11-11 20:47:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 280 states have (on average 1.525) internal successors, (427), 283 states have internal predecessors, (427), 60 states have call successors, (60), 22 states have call predecessors, (60), 22 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2024-11-11 20:47:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 546 transitions. [2024-11-11 20:47:44,378 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 546 transitions. Word has length 124 [2024-11-11 20:47:44,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:47:44,378 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 546 transitions. [2024-11-11 20:47:44,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:47:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 546 transitions. [2024-11-11 20:47:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-11 20:47:44,383 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:47:44,383 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:47:44,403 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:47:44,584 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:47:44,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:47:44,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:47:44,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1843508188, now seen corresponding path program 1 times [2024-11-11 20:47:44,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:47:44,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266765438] [2024-11-11 20:47:44,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:47:44,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:47:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:47:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:47:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:47:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:47:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:47:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:47:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:47:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:47:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:47:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:47:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:47:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:47:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:47:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:47:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:47:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-11 20:47:44,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:47:44,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266765438] [2024-11-11 20:47:44,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266765438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:47:44,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074706610] [2024-11-11 20:47:44,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:47:44,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:47:44,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:47:44,813 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:47:44,819 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:47:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:45,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:47:45,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:47:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-11 20:47:45,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:47:45,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074706610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:47:45,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:47:45,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-11-11 20:47:45,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458111933] [2024-11-11 20:47:45,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:47:45,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:47:45,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:47:45,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:47:45,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:47:45,128 INFO L87 Difference]: Start difference. First operand 363 states and 546 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-11 20:47:45,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:47:45,179 INFO L93 Difference]: Finished difference Result 717 states and 1082 transitions. [2024-11-11 20:47:45,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:47:45,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2024-11-11 20:47:45,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:47:45,184 INFO L225 Difference]: With dead ends: 717 [2024-11-11 20:47:45,185 INFO L226 Difference]: Without dead ends: 365 [2024-11-11 20:47:45,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:47:45,186 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 2 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1829 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:47:45,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1829 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:47:45,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-11 20:47:45,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2024-11-11 20:47:45,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 281 states have (on average 1.5231316725978647) internal successors, (428), 285 states have internal predecessors, (428), 60 states have call successors, (60), 22 states have call predecessors, (60), 23 states have return successors, (61), 59 states have call predecessors, (61), 59 states have call successors, (61) [2024-11-11 20:47:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 549 transitions. [2024-11-11 20:47:45,198 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 549 transitions. Word has length 125 [2024-11-11 20:47:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:47:45,199 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 549 transitions. [2024-11-11 20:47:45,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-11 20:47:45,199 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 549 transitions. [2024-11-11 20:47:45,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-11 20:47:45,200 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:47:45,200 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:47:45,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 20:47:45,406 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:47:45,407 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:47:45,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:47:45,407 INFO L85 PathProgramCache]: Analyzing trace with hash 490493493, now seen corresponding path program 1 times [2024-11-11 20:47:45,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:47:45,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007791543] [2024-11-11 20:47:45,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:47:45,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:47:45,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:45,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:47:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:45,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:47:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:45,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:47:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:45,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:47:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:45,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:47:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:45,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:47:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:45,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:47:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:45,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:47:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:45,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:47:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:45,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:47:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:45,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:47:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:45,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:47:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:45,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:47:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:45,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:47:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:45,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:47:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-11 20:47:45,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:47:45,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007791543] [2024-11-11 20:47:45,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007791543] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:47:45,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418777581] [2024-11-11 20:47:45,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:47:45,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:47:45,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:47:45,613 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:47:45,614 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:47:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:45,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 20:47:45,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:47:45,895 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-11 20:47:45,895 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:47:45,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418777581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:47:45,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:47:45,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-11-11 20:47:45,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979085607] [2024-11-11 20:47:45,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:47:45,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:47:45,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:47:45,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:47:45,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:47:45,897 INFO L87 Difference]: Start difference. First operand 365 states and 549 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-11 20:47:45,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:47:45,982 INFO L93 Difference]: Finished difference Result 719 states and 1087 transitions. [2024-11-11 20:47:45,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:47:45,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 126 [2024-11-11 20:47:45,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:47:45,989 INFO L225 Difference]: With dead ends: 719 [2024-11-11 20:47:45,989 INFO L226 Difference]: Without dead ends: 367 [2024-11-11 20:47:45,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:47:45,994 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 2 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1815 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:47:45,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1815 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:47:45,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-11 20:47:46,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2024-11-11 20:47:46,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 282 states have (on average 1.5212765957446808) internal successors, (429), 287 states have internal predecessors, (429), 60 states have call successors, (60), 22 states have call predecessors, (60), 24 states have return successors, (66), 59 states have call predecessors, (66), 59 states have call successors, (66) [2024-11-11 20:47:46,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 555 transitions. [2024-11-11 20:47:46,010 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 555 transitions. Word has length 126 [2024-11-11 20:47:46,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:47:46,010 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 555 transitions. [2024-11-11 20:47:46,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-11 20:47:46,010 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 555 transitions. [2024-11-11 20:47:46,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-11 20:47:46,012 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:47:46,012 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:47:46,030 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:47:46,212 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:47:46,213 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:47:46,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:47:46,214 INFO L85 PathProgramCache]: Analyzing trace with hash -214305394, now seen corresponding path program 1 times [2024-11-11 20:47:46,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:47:46,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300393511] [2024-11-11 20:47:46,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:47:46,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:47:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:46,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:47:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:46,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:47:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:46,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:47:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:46,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:47:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:46,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:47:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:46,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:47:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:46,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:47:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:46,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:47:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:46,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:47:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:46,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:47:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:46,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:47:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:46,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:47:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:46,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:47:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:46,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:47:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:46,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:47:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-11 20:47:46,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:47:46,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300393511] [2024-11-11 20:47:46,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300393511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:47:46,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:47:46,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:47:46,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071498713] [2024-11-11 20:47:46,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:47:46,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:47:46,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:47:46,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:47:46,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:47:46,491 INFO L87 Difference]: Start difference. First operand 367 states and 555 transitions. Second operand has 8 states, 7 states have (on average 11.142857142857142) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-11 20:47:48,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:47:48,349 INFO L93 Difference]: Finished difference Result 779 states and 1184 transitions. [2024-11-11 20:47:48,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:47:48,350 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.142857142857142) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 127 [2024-11-11 20:47:48,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:47:48,352 INFO L225 Difference]: With dead ends: 779 [2024-11-11 20:47:48,352 INFO L226 Difference]: Without dead ends: 435 [2024-11-11 20:47:48,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:47:48,354 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 770 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1837 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 2070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:47:48,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 926 Invalid, 2070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1837 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 20:47:48,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-11 20:47:48,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 367. [2024-11-11 20:47:48,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 282 states have (on average 1.5212765957446808) internal successors, (429), 287 states have internal predecessors, (429), 60 states have call successors, (60), 22 states have call predecessors, (60), 24 states have return successors, (65), 59 states have call predecessors, (65), 59 states have call successors, (65) [2024-11-11 20:47:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 554 transitions. [2024-11-11 20:47:48,376 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 554 transitions. Word has length 127 [2024-11-11 20:47:48,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:47:48,377 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 554 transitions. [2024-11-11 20:47:48,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.142857142857142) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-11 20:47:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 554 transitions. [2024-11-11 20:47:48,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-11 20:47:48,380 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:47:48,380 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:47:48,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:47:48,380 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:47:48,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:47:48,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1524729219, now seen corresponding path program 2 times [2024-11-11 20:47:48,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:47:48,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046057593] [2024-11-11 20:47:48,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:47:48,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:47:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:48,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:47:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:48,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:47:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:48,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:47:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:48,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:47:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:48,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:47:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:48,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:47:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:48,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:47:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:48,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:47:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:48,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:47:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:48,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:47:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:48,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:47:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:48,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:47:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:48,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:47:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:48,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:47:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:48,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:47:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:48,564 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-11 20:47:48,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:47:48,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046057593] [2024-11-11 20:47:48,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046057593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:47:48,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:47:48,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:47:48,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017802322] [2024-11-11 20:47:48,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:47:48,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:47:48,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:47:48,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:47:48,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:47:48,566 INFO L87 Difference]: Start difference. First operand 367 states and 554 transitions. Second operand has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-11 20:47:50,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:47:50,099 INFO L93 Difference]: Finished difference Result 781 states and 1187 transitions. [2024-11-11 20:47:50,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:47:50,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 128 [2024-11-11 20:47:50,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:47:50,102 INFO L225 Difference]: With dead ends: 781 [2024-11-11 20:47:50,102 INFO L226 Difference]: Without dead ends: 437 [2024-11-11 20:47:50,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:47:50,106 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 813 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:47:50,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 926 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 20:47:50,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-11-11 20:47:50,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 369. [2024-11-11 20:47:50,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 283 states have (on average 1.519434628975265) internal successors, (430), 289 states have internal predecessors, (430), 60 states have call successors, (60), 22 states have call predecessors, (60), 25 states have return successors, (67), 59 states have call predecessors, (67), 59 states have call successors, (67) [2024-11-11 20:47:50,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 557 transitions. [2024-11-11 20:47:50,132 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 557 transitions. Word has length 128 [2024-11-11 20:47:50,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:47:50,132 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 557 transitions. [2024-11-11 20:47:50,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-11 20:47:50,133 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 557 transitions. [2024-11-11 20:47:50,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-11 20:47:50,136 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:47:50,136 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:47:50,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:47:50,136 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:47:50,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:47:50,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1406967309, now seen corresponding path program 1 times [2024-11-11 20:47:50,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:47:50,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798852512] [2024-11-11 20:47:50,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:47:50,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:47:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:50,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:47:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:50,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:47:50,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:50,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:47:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:50,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:47:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:50,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:47:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:50,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:47:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:50,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:47:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:50,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:47:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:50,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:47:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:50,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:47:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:50,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:47:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:50,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:47:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:50,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:47:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:50,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:47:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:50,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:47:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:50,392 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-11 20:47:50,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:47:50,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798852512] [2024-11-11 20:47:50,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798852512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:47:50,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:47:50,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 20:47:50,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553435232] [2024-11-11 20:47:50,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:47:50,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 20:47:50,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:47:50,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 20:47:50,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:47:50,394 INFO L87 Difference]: Start difference. First operand 369 states and 557 transitions. Second operand has 11 states, 10 states have (on average 8.3) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-11 20:47:52,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:47:52,636 INFO L93 Difference]: Finished difference Result 779 states and 1182 transitions. [2024-11-11 20:47:52,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:47:52,637 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.3) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 129 [2024-11-11 20:47:52,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:47:52,639 INFO L225 Difference]: With dead ends: 779 [2024-11-11 20:47:52,639 INFO L226 Difference]: Without dead ends: 437 [2024-11-11 20:47:52,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-11 20:47:52,642 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 790 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 3046 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 3291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 3046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:47:52,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1329 Invalid, 3291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 3046 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 20:47:52,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-11-11 20:47:52,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 369. [2024-11-11 20:47:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 283 states have (on average 1.519434628975265) internal successors, (430), 289 states have internal predecessors, (430), 60 states have call successors, (60), 22 states have call predecessors, (60), 25 states have return successors, (66), 59 states have call predecessors, (66), 59 states have call successors, (66) [2024-11-11 20:47:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 556 transitions. [2024-11-11 20:47:52,667 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 556 transitions. Word has length 129 [2024-11-11 20:47:52,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:47:52,667 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 556 transitions. [2024-11-11 20:47:52,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.3) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-11 20:47:52,667 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 556 transitions. [2024-11-11 20:47:52,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-11 20:47:52,669 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:47:52,669 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:47:52,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:47:52,669 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:47:52,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:47:52,669 INFO L85 PathProgramCache]: Analyzing trace with hash 954508734, now seen corresponding path program 2 times [2024-11-11 20:47:52,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:47:52,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122560099] [2024-11-11 20:47:52,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:47:52,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:47:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:52,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:47:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:52,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:47:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:52,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:47:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:52,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:47:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:52,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:47:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:52,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:47:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:52,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:47:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:52,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:47:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:52,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:47:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:52,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:47:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:52,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:47:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:52,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:47:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:52,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:47:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:52,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:47:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:52,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:47:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:52,842 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-11 20:47:52,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:47:52,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122560099] [2024-11-11 20:47:52,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122560099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:47:52,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:47:52,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 20:47:52,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987861647] [2024-11-11 20:47:52,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:47:52,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 20:47:52,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:47:52,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 20:47:52,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:47:52,844 INFO L87 Difference]: Start difference. First operand 369 states and 556 transitions. Second operand has 11 states, 10 states have (on average 8.4) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-11 20:47:54,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:47:54,430 INFO L93 Difference]: Finished difference Result 781 states and 1188 transitions. [2024-11-11 20:47:54,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:47:54,431 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.4) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 130 [2024-11-11 20:47:54,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:47:54,433 INFO L225 Difference]: With dead ends: 781 [2024-11-11 20:47:54,433 INFO L226 Difference]: Without dead ends: 439 [2024-11-11 20:47:54,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-11 20:47:54,434 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 785 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 3093 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 3331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 3093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:47:54,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 1329 Invalid, 3331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 3093 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 20:47:54,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-11 20:47:54,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 371. [2024-11-11 20:47:54,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 284 states have (on average 1.517605633802817) internal successors, (431), 291 states have internal predecessors, (431), 60 states have call successors, (60), 22 states have call predecessors, (60), 26 states have return successors, (71), 59 states have call predecessors, (71), 59 states have call successors, (71) [2024-11-11 20:47:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 562 transitions. [2024-11-11 20:47:54,454 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 562 transitions. Word has length 130 [2024-11-11 20:47:54,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:47:54,455 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 562 transitions. [2024-11-11 20:47:54,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.4) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-11 20:47:54,455 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 562 transitions. [2024-11-11 20:47:54,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-11 20:47:54,457 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:47:54,457 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:47:54,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:47:54,457 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:47:54,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:47:54,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1241338906, now seen corresponding path program 1 times [2024-11-11 20:47:54,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:47:54,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43538947] [2024-11-11 20:47:54,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:47:54,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:47:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:54,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:47:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:54,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:47:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:54,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:47:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:54,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:47:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:54,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:47:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:54,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:47:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:54,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:47:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:54,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:47:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:54,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:47:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:54,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:47:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:54,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:47:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:54,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:47:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:54,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:47:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:54,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 20:47:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:54,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:47:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-11 20:47:54,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:47:54,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43538947] [2024-11-11 20:47:54,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43538947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:47:54,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:47:54,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:47:54,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546888755] [2024-11-11 20:47:54,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:47:54,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:47:54,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:47:54,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:47:54,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:47:54,581 INFO L87 Difference]: Start difference. First operand 371 states and 562 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-11 20:47:55,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:47:55,804 INFO L93 Difference]: Finished difference Result 783 states and 1191 transitions. [2024-11-11 20:47:55,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:47:55,805 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 131 [2024-11-11 20:47:55,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:47:55,810 INFO L225 Difference]: With dead ends: 783 [2024-11-11 20:47:55,814 INFO L226 Difference]: Without dead ends: 439 [2024-11-11 20:47:55,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:47:55,816 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 806 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:47:55,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 917 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1749 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:47:55,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-11 20:47:55,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 371. [2024-11-11 20:47:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 284 states have (on average 1.517605633802817) internal successors, (431), 291 states have internal predecessors, (431), 60 states have call successors, (60), 22 states have call predecessors, (60), 26 states have return successors, (71), 59 states have call predecessors, (71), 59 states have call successors, (71) [2024-11-11 20:47:55,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 562 transitions. [2024-11-11 20:47:55,841 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 562 transitions. Word has length 131 [2024-11-11 20:47:55,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:47:55,842 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 562 transitions. [2024-11-11 20:47:55,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-11 20:47:55,842 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 562 transitions. [2024-11-11 20:47:55,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-11 20:47:55,844 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:47:55,844 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:47:55,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 20:47:55,845 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:47:55,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:47:55,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1827615128, now seen corresponding path program 1 times [2024-11-11 20:47:55,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:47:55,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485805011] [2024-11-11 20:47:55,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:47:55,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:47:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:55,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:47:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:55,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:47:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:55,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:47:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:55,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:47:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:55,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:47:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:55,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:47:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:55,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:47:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:55,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:47:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:55,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:47:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:55,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:47:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:55,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:47:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:55,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:47:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:55,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:47:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:56,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 20:47:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:56,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:47:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:56,004 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 20:47:56,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:47:56,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485805011] [2024-11-11 20:47:56,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485805011] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:47:56,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781504030] [2024-11-11 20:47:56,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:47:56,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:47:56,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:47:56,009 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:47:56,011 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:47:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:56,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:47:56,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:47:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 20:47:56,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:47:56,414 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 20:47:56,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781504030] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:47:56,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:47:56,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-11-11 20:47:56,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368658830] [2024-11-11 20:47:56,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:47:56,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:47:56,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:47:56,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:47:56,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:47:56,439 INFO L87 Difference]: Start difference. First operand 371 states and 562 transitions. Second operand has 10 states, 10 states have (on average 11.7) internal successors, (117), 7 states have internal predecessors, (117), 2 states have call successors, (34), 5 states have call predecessors, (34), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-11 20:47:57,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:47:57,831 INFO L93 Difference]: Finished difference Result 935 states and 1485 transitions. [2024-11-11 20:47:57,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:47:57,831 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 7 states have internal predecessors, (117), 2 states have call successors, (34), 5 states have call predecessors, (34), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 131 [2024-11-11 20:47:57,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:47:57,838 INFO L225 Difference]: With dead ends: 935 [2024-11-11 20:47:57,838 INFO L226 Difference]: Without dead ends: 766 [2024-11-11 20:47:57,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:47:57,840 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 1097 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 2228 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 2587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 2228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:47:57,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 1259 Invalid, 2587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 2228 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 20:47:57,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2024-11-11 20:47:57,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 674. [2024-11-11 20:47:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 523 states have (on average 1.5850860420650095) internal successors, (829), 530 states have internal predecessors, (829), 124 states have call successors, (124), 22 states have call predecessors, (124), 26 states have return successors, (145), 123 states have call predecessors, (145), 123 states have call successors, (145) [2024-11-11 20:47:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1098 transitions. [2024-11-11 20:47:57,884 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1098 transitions. Word has length 131 [2024-11-11 20:47:57,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:47:57,885 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 1098 transitions. [2024-11-11 20:47:57,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.7) internal successors, (117), 7 states have internal predecessors, (117), 2 states have call successors, (34), 5 states have call predecessors, (34), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-11 20:47:57,885 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1098 transitions. [2024-11-11 20:47:57,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-11 20:47:57,888 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:47:57,889 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:47:57,910 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:47:58,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:47:58,090 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:47:58,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:47:58,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1753103115, now seen corresponding path program 1 times [2024-11-11 20:47:58,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:47:58,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145843744] [2024-11-11 20:47:58,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:47:58,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:47:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:58,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:47:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:58,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:47:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:58,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:47:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:58,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:47:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:58,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:47:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:58,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:47:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:58,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:47:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:58,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:47:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:58,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:47:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:58,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:47:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:58,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:47:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:58,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:47:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:58,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:47:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:58,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 20:47:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:58,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:47:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 20:47:58,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:47:58,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145843744] [2024-11-11 20:47:58,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145843744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:47:58,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:47:58,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:47:58,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633589090] [2024-11-11 20:47:58,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:47:58,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:47:58,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:47:58,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:47:58,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:47:58,193 INFO L87 Difference]: Start difference. First operand 674 states and 1098 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:47:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:47:59,080 INFO L93 Difference]: Finished difference Result 1656 states and 2764 transitions. [2024-11-11 20:47:59,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:47:59,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2024-11-11 20:47:59,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:47:59,087 INFO L225 Difference]: With dead ends: 1656 [2024-11-11 20:47:59,087 INFO L226 Difference]: Without dead ends: 1050 [2024-11-11 20:47:59,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:47:59,091 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 869 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:47:59,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 676 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 20:47:59,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2024-11-11 20:47:59,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 974. [2024-11-11 20:47:59,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 759 states have (on average 1.5994729907773386) internal successors, (1214), 766 states have internal predecessors, (1214), 188 states have call successors, (188), 22 states have call predecessors, (188), 26 states have return successors, (219), 187 states have call predecessors, (219), 187 states have call successors, (219) [2024-11-11 20:47:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1621 transitions. [2024-11-11 20:47:59,137 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1621 transitions. Word has length 137 [2024-11-11 20:47:59,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:47:59,137 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1621 transitions. [2024-11-11 20:47:59,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:47:59,137 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1621 transitions. [2024-11-11 20:47:59,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-11 20:47:59,143 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:47:59,143 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:47:59,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:47:59,143 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:47:59,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:47:59,144 INFO L85 PathProgramCache]: Analyzing trace with hash 960373373, now seen corresponding path program 1 times [2024-11-11 20:47:59,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:47:59,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179550414] [2024-11-11 20:47:59,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:47:59,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:47:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:59,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:47:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:59,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:47:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:59,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:47:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:59,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:47:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:59,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:47:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:59,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:47:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:59,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:47:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:59,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:47:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:59,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:47:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:59,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:47:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:59,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:47:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:59,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:47:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:59,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:47:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:59,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 20:47:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:59,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:47:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:47:59,242 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 20:47:59,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:47:59,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179550414] [2024-11-11 20:47:59,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179550414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:47:59,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:47:59,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:47:59,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530062423] [2024-11-11 20:47:59,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:47:59,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:47:59,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:47:59,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:47:59,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:47:59,245 INFO L87 Difference]: Start difference. First operand 974 states and 1621 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:48:00,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:48:00,215 INFO L93 Difference]: Finished difference Result 2371 states and 4009 transitions. [2024-11-11 20:48:00,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:48:00,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2024-11-11 20:48:00,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:48:00,221 INFO L225 Difference]: With dead ends: 2371 [2024-11-11 20:48:00,221 INFO L226 Difference]: Without dead ends: 1518 [2024-11-11 20:48:00,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:48:00,224 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 875 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:48:00,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 647 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 20:48:00,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-11-11 20:48:00,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1442. [2024-11-11 20:48:00,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1442 states, 1132 states have (on average 1.6086572438162545) internal successors, (1821), 1139 states have internal predecessors, (1821), 283 states have call successors, (283), 22 states have call predecessors, (283), 26 states have return successors, (314), 282 states have call predecessors, (314), 282 states have call successors, (314) [2024-11-11 20:48:00,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 2418 transitions. [2024-11-11 20:48:00,265 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 2418 transitions. Word has length 138 [2024-11-11 20:48:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:48:00,265 INFO L471 AbstractCegarLoop]: Abstraction has 1442 states and 2418 transitions. [2024-11-11 20:48:00,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:48:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 2418 transitions. [2024-11-11 20:48:00,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-11 20:48:00,271 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:48:00,271 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:48:00,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 20:48:00,271 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:48:00,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:48:00,272 INFO L85 PathProgramCache]: Analyzing trace with hash 391585495, now seen corresponding path program 1 times [2024-11-11 20:48:00,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:48:00,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641294090] [2024-11-11 20:48:00,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:48:00,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:48:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:00,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:48:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:00,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:48:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:00,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:48:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:00,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:48:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:00,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:48:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:00,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:48:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:00,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:48:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:00,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:48:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:00,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:48:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:00,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:48:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:00,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:48:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:00,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:48:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:00,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 20:48:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:00,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 20:48:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:00,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:48:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 20:48:00,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:48:00,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641294090] [2024-11-11 20:48:00,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641294090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:48:00,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:48:00,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:48:00,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370107488] [2024-11-11 20:48:00,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:48:00,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:48:00,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:48:00,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:48:00,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:48:00,340 INFO L87 Difference]: Start difference. First operand 1442 states and 2418 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:48:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:48:01,158 INFO L93 Difference]: Finished difference Result 3418 states and 5850 transitions. [2024-11-11 20:48:01,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:48:01,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2024-11-11 20:48:01,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:48:01,168 INFO L225 Difference]: With dead ends: 3418 [2024-11-11 20:48:01,168 INFO L226 Difference]: Without dead ends: 2222 [2024-11-11 20:48:01,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:48:01,171 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 871 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:48:01,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 645 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:48:01,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2024-11-11 20:48:01,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 2146. [2024-11-11 20:48:01,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2146 states, 1713 states have (on average 1.6158785755983653) internal successors, (2768), 1720 states have internal predecessors, (2768), 406 states have call successors, (406), 22 states have call predecessors, (406), 26 states have return successors, (453), 405 states have call predecessors, (453), 405 states have call successors, (453) [2024-11-11 20:48:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 3627 transitions. [2024-11-11 20:48:01,238 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 3627 transitions. Word has length 139 [2024-11-11 20:48:01,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:48:01,238 INFO L471 AbstractCegarLoop]: Abstraction has 2146 states and 3627 transitions. [2024-11-11 20:48:01,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:48:01,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 3627 transitions. [2024-11-11 20:48:01,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-11 20:48:01,246 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:48:01,246 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:48:01,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:48:01,247 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:48:01,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:48:01,247 INFO L85 PathProgramCache]: Analyzing trace with hash -736236066, now seen corresponding path program 1 times [2024-11-11 20:48:01,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:48:01,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998164972] [2024-11-11 20:48:01,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:48:01,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:48:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:01,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:48:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:01,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:48:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:01,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:48:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:01,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:48:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:01,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:48:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:01,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:48:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:01,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:48:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:01,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:48:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:01,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:48:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:01,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:48:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:01,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:48:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:01,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:48:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:01,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 20:48:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:01,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-11 20:48:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:01,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:48:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 20:48:01,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:48:01,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998164972] [2024-11-11 20:48:01,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998164972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:48:01,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:48:01,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:48:01,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540957677] [2024-11-11 20:48:01,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:48:01,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:48:01,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:48:01,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:48:01,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:48:01,338 INFO L87 Difference]: Start difference. First operand 2146 states and 3627 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:48:02,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:48:02,166 INFO L93 Difference]: Finished difference Result 5037 states and 8704 transitions. [2024-11-11 20:48:02,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:48:02,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 140 [2024-11-11 20:48:02,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:48:02,179 INFO L225 Difference]: With dead ends: 5037 [2024-11-11 20:48:02,179 INFO L226 Difference]: Without dead ends: 3341 [2024-11-11 20:48:02,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:48:02,183 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 881 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:48:02,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 645 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:48:02,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3341 states. [2024-11-11 20:48:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3341 to 3265. [2024-11-11 20:48:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3265 states, 2653 states have (on average 1.6204297022238974) internal successors, (4299), 2660 states have internal predecessors, (4299), 585 states have call successors, (585), 22 states have call predecessors, (585), 26 states have return successors, (658), 584 states have call predecessors, (658), 584 states have call successors, (658) [2024-11-11 20:48:02,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3265 states to 3265 states and 5542 transitions. [2024-11-11 20:48:02,319 INFO L78 Accepts]: Start accepts. Automaton has 3265 states and 5542 transitions. Word has length 140 [2024-11-11 20:48:02,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:48:02,320 INFO L471 AbstractCegarLoop]: Abstraction has 3265 states and 5542 transitions. [2024-11-11 20:48:02,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:48:02,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3265 states and 5542 transitions. [2024-11-11 20:48:02,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-11 20:48:02,334 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:48:02,334 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:48:02,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 20:48:02,334 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:48:02,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:48:02,335 INFO L85 PathProgramCache]: Analyzing trace with hash -950274605, now seen corresponding path program 1 times [2024-11-11 20:48:02,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:48:02,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063288730] [2024-11-11 20:48:02,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:48:02,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:48:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:02,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:48:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:02,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:48:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:02,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:48:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:02,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:48:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:02,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:48:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:02,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:48:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:02,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:48:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:02,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:48:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:02,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:48:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:02,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:48:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:02,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:48:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:02,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:48:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:02,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 20:48:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:02,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 20:48:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:02,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:48:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:02,437 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 20:48:02,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:48:02,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063288730] [2024-11-11 20:48:02,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063288730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:48:02,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:48:02,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:48:02,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610639726] [2024-11-11 20:48:02,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:48:02,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:48:02,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:48:02,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:48:02,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:48:02,438 INFO L87 Difference]: Start difference. First operand 3265 states and 5542 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:48:03,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:48:03,383 INFO L93 Difference]: Finished difference Result 7955 states and 13803 transitions. [2024-11-11 20:48:03,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:48:03,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 141 [2024-11-11 20:48:03,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:48:03,407 INFO L225 Difference]: With dead ends: 7955 [2024-11-11 20:48:03,408 INFO L226 Difference]: Without dead ends: 5372 [2024-11-11 20:48:03,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:48:03,416 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 863 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:48:03,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 702 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 20:48:03,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5372 states. [2024-11-11 20:48:03,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5372 to 5296. [2024-11-11 20:48:03,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5296 states, 4308 states have (on average 1.6135097493036212) internal successors, (6951), 4315 states have internal predecessors, (6951), 961 states have call successors, (961), 22 states have call predecessors, (961), 26 states have return successors, (1078), 960 states have call predecessors, (1078), 960 states have call successors, (1078) [2024-11-11 20:48:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5296 states to 5296 states and 8990 transitions. [2024-11-11 20:48:03,644 INFO L78 Accepts]: Start accepts. Automaton has 5296 states and 8990 transitions. Word has length 141 [2024-11-11 20:48:03,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:48:03,644 INFO L471 AbstractCegarLoop]: Abstraction has 5296 states and 8990 transitions. [2024-11-11 20:48:03,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:48:03,645 INFO L276 IsEmpty]: Start isEmpty. Operand 5296 states and 8990 transitions. [2024-11-11 20:48:03,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-11 20:48:03,659 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:48:03,659 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:48:03,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 20:48:03,659 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:48:03,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:48:03,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2125382370, now seen corresponding path program 1 times [2024-11-11 20:48:03,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:48:03,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793787554] [2024-11-11 20:48:03,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:48:03,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:48:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:03,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:48:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:03,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:48:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:03,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:48:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:03,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:48:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:03,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:48:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:03,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:48:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:03,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:48:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:03,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:48:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:03,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:48:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:03,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:48:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:03,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:48:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:03,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:48:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:03,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-11 20:48:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:03,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-11 20:48:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:03,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:48:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:03,734 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 20:48:03,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:48:03,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793787554] [2024-11-11 20:48:03,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793787554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:48:03,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:48:03,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:48:03,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127815358] [2024-11-11 20:48:03,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:48:03,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:48:03,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:48:03,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:48:03,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:48:03,736 INFO L87 Difference]: Start difference. First operand 5296 states and 8990 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:48:04,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:48:04,811 INFO L93 Difference]: Finished difference Result 13097 states and 22712 transitions. [2024-11-11 20:48:04,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:48:04,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 142 [2024-11-11 20:48:04,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:48:04,855 INFO L225 Difference]: With dead ends: 13097 [2024-11-11 20:48:04,855 INFO L226 Difference]: Without dead ends: 8860 [2024-11-11 20:48:04,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:48:04,869 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 889 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:48:04,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 646 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 20:48:04,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8860 states. [2024-11-11 20:48:05,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8860 to 8784. [2024-11-11 20:48:05,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8784 states, 7190 states have (on average 1.6112656467315716) internal successors, (11585), 7197 states have internal predecessors, (11585), 1567 states have call successors, (1567), 22 states have call predecessors, (1567), 26 states have return successors, (1762), 1566 states have call predecessors, (1762), 1566 states have call successors, (1762) [2024-11-11 20:48:05,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8784 states to 8784 states and 14914 transitions. [2024-11-11 20:48:05,300 INFO L78 Accepts]: Start accepts. Automaton has 8784 states and 14914 transitions. Word has length 142 [2024-11-11 20:48:05,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:48:05,300 INFO L471 AbstractCegarLoop]: Abstraction has 8784 states and 14914 transitions. [2024-11-11 20:48:05,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:48:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand 8784 states and 14914 transitions. [2024-11-11 20:48:05,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-11 20:48:05,378 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:48:05,378 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:48:05,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 20:48:05,379 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:48:05,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:48:05,379 INFO L85 PathProgramCache]: Analyzing trace with hash -2006253163, now seen corresponding path program 1 times [2024-11-11 20:48:05,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:48:05,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636793469] [2024-11-11 20:48:05,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:48:05,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:48:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:05,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:48:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:05,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:48:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:05,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:48:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:05,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:48:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:05,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:48:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:05,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:48:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:05,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:48:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:05,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:48:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:05,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:48:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:05,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:48:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:05,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:48:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:05,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:48:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:05,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 20:48:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:05,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-11 20:48:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:05,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:48:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:05,483 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 20:48:05,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:48:05,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636793469] [2024-11-11 20:48:05,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636793469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:48:05,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:48:05,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:48:05,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564641799] [2024-11-11 20:48:05,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:48:05,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:48:05,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:48:05,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:48:05,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:48:05,485 INFO L87 Difference]: Start difference. First operand 8784 states and 14914 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:48:06,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:48:06,807 INFO L93 Difference]: Finished difference Result 22756 states and 39418 transitions. [2024-11-11 20:48:06,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:48:06,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 143 [2024-11-11 20:48:06,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:48:06,862 INFO L225 Difference]: With dead ends: 22756 [2024-11-11 20:48:06,863 INFO L226 Difference]: Without dead ends: 15453 [2024-11-11 20:48:06,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:48:06,888 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 847 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:48:06,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 676 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 20:48:06,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15453 states. [2024-11-11 20:48:07,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15453 to 15377. [2024-11-11 20:48:07,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15377 states, 12580 states have (on average 1.6018282988871224) internal successors, (20151), 12587 states have internal predecessors, (20151), 2770 states have call successors, (2770), 22 states have call predecessors, (2770), 26 states have return successors, (3109), 2769 states have call predecessors, (3109), 2769 states have call successors, (3109) [2024-11-11 20:48:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15377 states to 15377 states and 26030 transitions. [2024-11-11 20:48:07,459 INFO L78 Accepts]: Start accepts. Automaton has 15377 states and 26030 transitions. Word has length 143 [2024-11-11 20:48:07,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:48:07,460 INFO L471 AbstractCegarLoop]: Abstraction has 15377 states and 26030 transitions. [2024-11-11 20:48:07,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:48:07,460 INFO L276 IsEmpty]: Start isEmpty. Operand 15377 states and 26030 transitions. [2024-11-11 20:48:07,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-11 20:48:07,506 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:48:07,506 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:07,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 20:48:07,506 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:48:07,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:48:07,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1315565085, now seen corresponding path program 1 times [2024-11-11 20:48:07,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:48:07,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756191315] [2024-11-11 20:48:07,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:48:07,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:48:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:07,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:48:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:07,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:48:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:07,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:48:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:07,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:48:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:07,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:48:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:07,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:48:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:07,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:48:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:07,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:48:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:07,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:48:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:07,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:48:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:07,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:48:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:07,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:48:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:07,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:48:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:07,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-11 20:48:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:07,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:48:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:07,581 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 20:48:07,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:48:07,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756191315] [2024-11-11 20:48:07,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756191315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:48:07,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:48:07,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:48:07,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843023885] [2024-11-11 20:48:07,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:48:07,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:48:07,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:48:07,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:48:07,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:48:07,583 INFO L87 Difference]: Start difference. First operand 15377 states and 26030 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:48:08,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:48:08,971 INFO L93 Difference]: Finished difference Result 40712 states and 70401 transitions. [2024-11-11 20:48:08,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:48:08,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 144 [2024-11-11 20:48:08,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:48:09,078 INFO L225 Difference]: With dead ends: 40712 [2024-11-11 20:48:09,078 INFO L226 Difference]: Without dead ends: 27423 [2024-11-11 20:48:09,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:48:09,108 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 875 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:48:09,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 670 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:48:09,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27423 states. [2024-11-11 20:48:10,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27423 to 27347. [2024-11-11 20:48:10,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27347 states, 22511 states have (on average 1.5973968282173159) internal successors, (35959), 22518 states have internal predecessors, (35959), 4809 states have call successors, (4809), 22 states have call predecessors, (4809), 26 states have return successors, (5422), 4808 states have call predecessors, (5422), 4808 states have call successors, (5422) [2024-11-11 20:48:10,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27347 states to 27347 states and 46190 transitions. [2024-11-11 20:48:10,208 INFO L78 Accepts]: Start accepts. Automaton has 27347 states and 46190 transitions. Word has length 144 [2024-11-11 20:48:10,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:48:10,208 INFO L471 AbstractCegarLoop]: Abstraction has 27347 states and 46190 transitions. [2024-11-11 20:48:10,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:48:10,209 INFO L276 IsEmpty]: Start isEmpty. Operand 27347 states and 46190 transitions. [2024-11-11 20:48:10,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-11 20:48:10,247 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:48:10,247 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:10,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 20:48:10,248 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:48:10,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:48:10,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1254652489, now seen corresponding path program 1 times [2024-11-11 20:48:10,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:48:10,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032245965] [2024-11-11 20:48:10,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:48:10,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:48:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:10,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:48:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:10,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:48:10,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:10,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:48:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:10,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:48:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:10,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:48:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:10,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:48:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:10,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:48:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:10,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:48:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:10,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:48:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:10,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:48:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:10,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:48:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:10,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 20:48:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:10,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 20:48:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:10,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 20:48:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:10,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:48:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:10,363 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 20:48:10,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:48:10,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032245965] [2024-11-11 20:48:10,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032245965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:48:10,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:48:10,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:48:10,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715333088] [2024-11-11 20:48:10,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:48:10,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:48:10,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:48:10,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:48:10,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:48:10,366 INFO L87 Difference]: Start difference. First operand 27347 states and 46190 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:48:12,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:48:12,860 INFO L93 Difference]: Finished difference Result 74499 states and 128000 transitions. [2024-11-11 20:48:12,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:48:12,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 145 [2024-11-11 20:48:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:48:13,024 INFO L225 Difference]: With dead ends: 74499 [2024-11-11 20:48:13,025 INFO L226 Difference]: Without dead ends: 49972 [2024-11-11 20:48:13,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:48:13,077 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 869 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:48:13,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 655 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 20:48:13,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49972 states. [2024-11-11 20:48:14,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49972 to 49896. [2024-11-11 20:48:14,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49896 states, 41345 states have (on average 1.5914862740355544) internal successors, (65800), 41352 states have internal predecessors, (65800), 8524 states have call successors, (8524), 22 states have call predecessors, (8524), 26 states have return successors, (9669), 8523 states have call predecessors, (9669), 8523 states have call successors, (9669) [2024-11-11 20:48:14,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49896 states to 49896 states and 83993 transitions. [2024-11-11 20:48:14,929 INFO L78 Accepts]: Start accepts. Automaton has 49896 states and 83993 transitions. Word has length 145 [2024-11-11 20:48:14,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:48:14,929 INFO L471 AbstractCegarLoop]: Abstraction has 49896 states and 83993 transitions. [2024-11-11 20:48:14,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:48:14,930 INFO L276 IsEmpty]: Start isEmpty. Operand 49896 states and 83993 transitions. [2024-11-11 20:48:14,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-11 20:48:14,974 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:48:14,974 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:14,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 20:48:14,974 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:48:14,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:48:14,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1634548419, now seen corresponding path program 1 times [2024-11-11 20:48:14,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:48:14,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415585949] [2024-11-11 20:48:14,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:48:14,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:48:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:15,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:48:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:15,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:48:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:15,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:48:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:15,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:48:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:15,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:48:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:15,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:48:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:15,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:48:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:15,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:48:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:15,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:48:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:15,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:48:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:15,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:48:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:15,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 20:48:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:15,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 20:48:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:15,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 20:48:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:15,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:48:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 20:48:15,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:48:15,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415585949] [2024-11-11 20:48:15,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415585949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:48:15,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:48:15,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:48:15,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579630500] [2024-11-11 20:48:15,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:48:15,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:48:15,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:48:15,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:48:15,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:48:15,073 INFO L87 Difference]: Start difference. First operand 49896 states and 83993 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:48:18,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:48:18,144 INFO L93 Difference]: Finished difference Result 92985 states and 160131 transitions. [2024-11-11 20:48:18,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:48:18,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 146 [2024-11-11 20:48:18,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:48:18,545 INFO L225 Difference]: With dead ends: 92985 [2024-11-11 20:48:18,546 INFO L226 Difference]: Without dead ends: 92816 [2024-11-11 20:48:18,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:48:18,587 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 848 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:48:18,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 678 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:48:18,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92816 states. [2024-11-11 20:48:21,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92816 to 92740. [2024-11-11 20:48:21,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92740 states, 77390 states have (on average 1.5840031011758624) internal successors, (122586), 77397 states have internal predecessors, (122586), 15323 states have call successors, (15323), 22 states have call predecessors, (15323), 26 states have return successors, (17514), 15322 states have call predecessors, (17514), 15322 states have call successors, (17514) [2024-11-11 20:48:22,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92740 states to 92740 states and 155423 transitions. [2024-11-11 20:48:22,303 INFO L78 Accepts]: Start accepts. Automaton has 92740 states and 155423 transitions. Word has length 146 [2024-11-11 20:48:22,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:48:22,304 INFO L471 AbstractCegarLoop]: Abstraction has 92740 states and 155423 transitions. [2024-11-11 20:48:22,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:48:22,304 INFO L276 IsEmpty]: Start isEmpty. Operand 92740 states and 155423 transitions. [2024-11-11 20:48:22,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 20:48:22,355 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:48:22,356 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:22,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 20:48:22,356 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:48:22,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:48:22,356 INFO L85 PathProgramCache]: Analyzing trace with hash 761092662, now seen corresponding path program 1 times [2024-11-11 20:48:22,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:48:22,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159773063] [2024-11-11 20:48:22,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:48:22,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:48:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:22,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:48:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:22,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:48:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:22,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:48:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:22,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:48:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:22,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:48:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:22,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:48:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:22,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:48:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:22,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:48:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:22,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:48:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:22,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:48:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:22,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:48:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:22,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 20:48:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:22,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 20:48:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:22,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-11 20:48:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:22,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:48:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-11 20:48:22,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:48:22,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159773063] [2024-11-11 20:48:22,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159773063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:48:22,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602324861] [2024-11-11 20:48:22,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:48:22,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:48:22,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:48:22,593 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:48:22,594 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:48:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:48:22,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-11 20:48:22,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:48:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 20:48:23,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:48:23,433 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:48:23,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602324861] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:48:23,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:48:23,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 30 [2024-11-11 20:48:23,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095581385] [2024-11-11 20:48:23,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:48:23,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-11 20:48:23,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:48:23,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-11 20:48:23,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=796, Unknown=0, NotChecked=0, Total=870 [2024-11-11 20:48:23,436 INFO L87 Difference]: Start difference. First operand 92740 states and 155423 transitions. Second operand has 30 states, 29 states have (on average 8.448275862068966) internal successors, (245), 23 states have internal predecessors, (245), 9 states have call successors, (45), 11 states have call predecessors, (45), 11 states have return successors, (39), 11 states have call predecessors, (39), 9 states have call successors, (39) [2024-11-11 20:48:43,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:48:43,193 INFO L93 Difference]: Finished difference Result 370341 states and 653193 transitions. [2024-11-11 20:48:43,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-11-11 20:48:43,194 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 8.448275862068966) internal successors, (245), 23 states have internal predecessors, (245), 9 states have call successors, (45), 11 states have call predecessors, (45), 11 states have return successors, (39), 11 states have call predecessors, (39), 9 states have call successors, (39) Word has length 147 [2024-11-11 20:48:43,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:48:45,076 INFO L225 Difference]: With dead ends: 370341 [2024-11-11 20:48:45,076 INFO L226 Difference]: Without dead ends: 370178 [2024-11-11 20:48:45,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5198 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2486, Invalid=14806, Unknown=0, NotChecked=0, Total=17292 [2024-11-11 20:48:45,500 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 5884 mSDsluCounter, 7793 mSDsCounter, 0 mSdLazyCounter, 20334 mSolverCounterSat, 1859 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5896 SdHoareTripleChecker+Valid, 8204 SdHoareTripleChecker+Invalid, 22193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1859 IncrementalHoareTripleChecker+Valid, 20334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:48:45,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5896 Valid, 8204 Invalid, 22193 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1859 Valid, 20334 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2024-11-11 20:48:45,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370178 states. [2024-11-11 20:48:59,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370178 to 369477. [2024-11-11 20:48:59,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369477 states, 308460 states have (on average 1.5848862089087725) internal successors, (488874), 308268 states have internal predecessors, (488874), 60878 states have call successors, (60878), 120 states have call predecessors, (60878), 138 states have return successors, (84829), 61100 states have call predecessors, (84829), 60872 states have call successors, (84829)