./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product30.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product30.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 e931bf8fe4413228ccd3caf40302412c554842907046b600d394a87eb5d13e97 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 00:57:52,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 00:57:52,478 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 00:57:52,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 00:57:52,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 00:57:52,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 00:57:52,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 00:57:52,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 00:57:52,506 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 00:57:52,507 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 00:57:52,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 00:57:52,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 00:57:52,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 00:57:52,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 00:57:52,508 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 00:57:52,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 00:57:52,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 00:57:52,509 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 00:57:52,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 00:57:52,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 00:57:52,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 00:57:52,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 00:57:52,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 00:57:52,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 00:57:52,513 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 00:57:52,513 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 00:57:52,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 00:57:52,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 00:57:52,514 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 00:57:52,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 00:57:52,514 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 00:57:52,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 00:57:52,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:57:52,514 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 00:57:52,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 00:57:52,515 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 00:57:52,515 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 00:57:52,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 00:57:52,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 00:57:52,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 00:57:52,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 00:57:52,516 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 00:57:52,516 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 -> e931bf8fe4413228ccd3caf40302412c554842907046b600d394a87eb5d13e97 [2024-10-24 00:57:52,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 00:57:52,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 00:57:52,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 00:57:52,734 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 00:57:52,734 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 00:57:52,735 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product30.cil.c [2024-10-24 00:57:54,093 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 00:57:54,348 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 00:57:54,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product30.cil.c [2024-10-24 00:57:54,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79f0a073b/55eafd73dc8c499bb26223a5bac0cd62/FLAGa8da6416f [2024-10-24 00:57:54,383 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79f0a073b/55eafd73dc8c499bb26223a5bac0cd62 [2024-10-24 00:57:54,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 00:57:54,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 00:57:54,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 00:57:54,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 00:57:54,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 00:57:54,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:57:54" (1/1) ... [2024-10-24 00:57:54,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46346b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:54, skipping insertion in model container [2024-10-24 00:57:54,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:57:54" (1/1) ... [2024-10-24 00:57:54,461 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 00:57:54,918 WARN L248 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_spec9_product30.cil.c[41508,41521] [2024-10-24 00:57:55,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:57:55,019 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 00:57:55,027 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2024-10-24 00:57:55,028 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [363] [2024-10-24 00:57:55,029 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [740] [2024-10-24 00:57:55,029 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [878] [2024-10-24 00:57:55,029 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1945] [2024-10-24 00:57:55,029 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1980] [2024-10-24 00:57:55,029 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [1989] [2024-10-24 00:57:55,029 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2031] [2024-10-24 00:57:55,030 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2048] [2024-10-24 00:57:55,030 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2445] [2024-10-24 00:57:55,031 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2811] [2024-10-24 00:57:55,082 WARN L248 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_spec9_product30.cil.c[41508,41521] [2024-10-24 00:57:55,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:57:55,140 INFO L204 MainTranslator]: Completed translation [2024-10-24 00:57:55,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:55 WrapperNode [2024-10-24 00:57:55,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 00:57:55,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 00:57:55,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 00:57:55,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 00:57:55,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:55" (1/1) ... [2024-10-24 00:57:55,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:55" (1/1) ... [2024-10-24 00:57:55,221 INFO L138 Inliner]: procedures = 132, calls = 207, calls flagged for inlining = 61, calls inlined = 51, statements flattened = 925 [2024-10-24 00:57:55,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 00:57:55,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 00:57:55,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 00:57:55,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 00:57:55,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:55" (1/1) ... [2024-10-24 00:57:55,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:55" (1/1) ... [2024-10-24 00:57:55,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:55" (1/1) ... [2024-10-24 00:57:55,275 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-10-24 00:57:55,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:55" (1/1) ... [2024-10-24 00:57:55,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:55" (1/1) ... [2024-10-24 00:57:55,287 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:55" (1/1) ... [2024-10-24 00:57:55,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:55" (1/1) ... [2024-10-24 00:57:55,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:55" (1/1) ... [2024-10-24 00:57:55,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:55" (1/1) ... [2024-10-24 00:57:55,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 00:57:55,324 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 00:57:55,324 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 00:57:55,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 00:57:55,326 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:55" (1/1) ... [2024-10-24 00:57:55,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:57:55,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:57:55,359 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-10-24 00:57:55,361 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-10-24 00:57:55,398 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-10-24 00:57:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-10-24 00:57:55,398 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-10-24 00:57:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-10-24 00:57:55,398 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-10-24 00:57:55,398 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-10-24 00:57:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-24 00:57:55,399 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-24 00:57:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-24 00:57:55,399 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-24 00:57:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-24 00:57:55,400 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-24 00:57:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-24 00:57:55,400 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-24 00:57:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-10-24 00:57:55,401 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-10-24 00:57:55,401 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-24 00:57:55,401 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-24 00:57:55,401 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-24 00:57:55,402 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-24 00:57:55,402 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-24 00:57:55,402 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-24 00:57:55,402 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-24 00:57:55,402 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-24 00:57:55,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 00:57:55,402 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-24 00:57:55,402 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-24 00:57:55,402 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-24 00:57:55,402 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-24 00:57:55,402 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-24 00:57:55,403 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-24 00:57:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-24 00:57:55,403 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-24 00:57:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-24 00:57:55,403 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-24 00:57:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-10-24 00:57:55,403 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-10-24 00:57:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-24 00:57:55,403 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-24 00:57:55,403 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-10-24 00:57:55,404 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-10-24 00:57:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-24 00:57:55,404 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-24 00:57:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-24 00:57:55,404 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-24 00:57:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 00:57:55,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 00:57:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 00:57:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 00:57:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-24 00:57:55,405 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-24 00:57:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 00:57:55,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 00:57:55,592 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 00:57:55,594 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 00:57:56,312 INFO L? ?]: Removed 432 outVars from TransFormulas that were not future-live. [2024-10-24 00:57:56,312 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 00:57:56,356 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 00:57:56,358 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 00:57:56,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:57:56 BoogieIcfgContainer [2024-10-24 00:57:56,358 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 00:57:56,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 00:57:56,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 00:57:56,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 00:57:56,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:57:54" (1/3) ... [2024-10-24 00:57:56,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0e4682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:57:56, skipping insertion in model container [2024-10-24 00:57:56,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:57:55" (2/3) ... [2024-10-24 00:57:56,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0e4682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:57:56, skipping insertion in model container [2024-10-24 00:57:56,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:57:56" (3/3) ... [2024-10-24 00:57:56,366 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec9_product30.cil.c [2024-10-24 00:57:56,380 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 00:57:56,380 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 00:57:56,441 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 00:57:56,447 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;@3afb88fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 00:57:56,447 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 00:57:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 320 states, 242 states have (on average 1.5743801652892562) internal successors, (381), 246 states have internal predecessors, (381), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-24 00:57:56,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 00:57:56,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:56,473 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:56,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:56,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:56,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1024459576, now seen corresponding path program 1 times [2024-10-24 00:57:56,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:56,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354703264] [2024-10-24 00:57:56,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:56,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:56,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:56,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:56,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:57,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:57:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:57,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:57:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:57,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:57:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:57,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 00:57:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:57,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 00:57:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:57,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:57:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:57,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:57:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:57,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:57:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:57,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:57:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:57,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:57:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:57,079 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:57:57,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:57,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354703264] [2024-10-24 00:57:57,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354703264] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:57:57,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142291334] [2024-10-24 00:57:57,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:57,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:57,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:57:57,088 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-10-24 00:57:57,089 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-10-24 00:57:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:57,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 00:57:57,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:57:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:57:57,386 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:57:57,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142291334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:57,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:57:57,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-24 00:57:57,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761717140] [2024-10-24 00:57:57,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:57,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 00:57:57,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:57,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 00:57:57,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:57:57,418 INFO L87 Difference]: Start difference. First operand has 320 states, 242 states have (on average 1.5743801652892562) internal successors, (381), 246 states have internal predecessors, (381), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:57:57,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:57,490 INFO L93 Difference]: Finished difference Result 495 states and 737 transitions. [2024-10-24 00:57:57,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 00:57:57,492 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 95 [2024-10-24 00:57:57,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:57,506 INFO L225 Difference]: With dead ends: 495 [2024-10-24 00:57:57,507 INFO L226 Difference]: Without dead ends: 317 [2024-10-24 00:57:57,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 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-10-24 00:57:57,517 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:57,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 469 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:57:57,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-24 00:57:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2024-10-24 00:57:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 240 states have (on average 1.5583333333333333) internal successors, (374), 243 states have internal predecessors, (374), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 00:57:57,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 479 transitions. [2024-10-24 00:57:57,591 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 479 transitions. Word has length 95 [2024-10-24 00:57:57,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:57,592 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 479 transitions. [2024-10-24 00:57:57,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:57:57,593 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 479 transitions. [2024-10-24 00:57:57,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 00:57:57,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:57,599 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:57,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 00:57:57,799 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-10-24 00:57:57,800 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:57,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:57,800 INFO L85 PathProgramCache]: Analyzing trace with hash 961480731, now seen corresponding path program 1 times [2024-10-24 00:57:57,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:57,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521715090] [2024-10-24 00:57:57,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:57,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:57:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:57:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:57:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:57:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 00:57:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:57:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:57:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:57:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:57:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:57:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,126 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:57:58,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:58,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521715090] [2024-10-24 00:57:58,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521715090] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:57:58,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919520044] [2024-10-24 00:57:58,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:58,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:58,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:57:58,131 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-10-24 00:57:58,136 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-10-24 00:57:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 1008 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 00:57:58,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:57:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:57:58,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:57:58,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919520044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:58,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:57:58,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 00:57:58,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820114137] [2024-10-24 00:57:58,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:58,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:57:58,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:58,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:57:58,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:57:58,385 INFO L87 Difference]: Start difference. First operand 317 states and 479 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:57:58,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:58,448 INFO L93 Difference]: Finished difference Result 491 states and 724 transitions. [2024-10-24 00:57:58,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:57:58,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 96 [2024-10-24 00:57:58,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:58,451 INFO L225 Difference]: With dead ends: 491 [2024-10-24 00:57:58,452 INFO L226 Difference]: Without dead ends: 319 [2024-10-24 00:57:58,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:57:58,454 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 0 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:58,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 931 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:57:58,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-24 00:57:58,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2024-10-24 00:57:58,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 242 states have (on average 1.5537190082644627) internal successors, (376), 245 states have internal predecessors, (376), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 00:57:58,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 481 transitions. [2024-10-24 00:57:58,476 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 481 transitions. Word has length 96 [2024-10-24 00:57:58,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:58,476 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 481 transitions. [2024-10-24 00:57:58,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:57:58,477 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 481 transitions. [2024-10-24 00:57:58,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 00:57:58,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:58,482 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:58,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 00:57:58,683 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-10-24 00:57:58,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:58,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:58,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1328627556, now seen corresponding path program 1 times [2024-10-24 00:57:58,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:58,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120954517] [2024-10-24 00:57:58,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:58,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:57:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:57:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:57:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 00:57:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:57:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:57:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:57:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:57:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:57:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:57:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:57:58,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:58,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120954517] [2024-10-24 00:57:58,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120954517] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:57:58,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52868354] [2024-10-24 00:57:58,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:58,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:58,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:57:58,876 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-10-24 00:57:58,878 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-10-24 00:57:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:59,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:57:59,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:57:59,102 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:57:59,102 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:57:59,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52868354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:59,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:57:59,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 00:57:59,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766188691] [2024-10-24 00:57:59,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:59,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:57:59,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:59,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:57:59,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:57:59,104 INFO L87 Difference]: Start difference. First operand 319 states and 481 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:57:59,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:59,145 INFO L93 Difference]: Finished difference Result 668 states and 1021 transitions. [2024-10-24 00:57:59,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:57:59,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 103 [2024-10-24 00:57:59,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:59,148 INFO L225 Difference]: With dead ends: 668 [2024-10-24 00:57:59,148 INFO L226 Difference]: Without dead ends: 371 [2024-10-24 00:57:59,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:57:59,150 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 102 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:59,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 893 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:57:59,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-10-24 00:57:59,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 366. [2024-10-24 00:57:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 278 states have (on average 1.5683453237410072) internal successors, (436), 281 states have internal predecessors, (436), 64 states have call successors, (64), 23 states have call predecessors, (64), 23 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-24 00:57:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 563 transitions. [2024-10-24 00:57:59,178 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 563 transitions. Word has length 103 [2024-10-24 00:57:59,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:57:59,178 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 563 transitions. [2024-10-24 00:57:59,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:57:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 563 transitions. [2024-10-24 00:57:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 00:57:59,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:57:59,180 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:57:59,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 00:57:59,383 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-10-24 00:57:59,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:57:59,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:57:59,385 INFO L85 PathProgramCache]: Analyzing trace with hash -823921969, now seen corresponding path program 1 times [2024-10-24 00:57:59,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:57:59,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067679306] [2024-10-24 00:57:59,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:59,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:57:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:59,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:57:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:59,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:57:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:59,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:57:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:59,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:57:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:59,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:57:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:59,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:57:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:59,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 00:57:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:59,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:57:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:59,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:57:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:59,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:57:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:59,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:57:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:59,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:57:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:59,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:57:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:59,596 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:57:59,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:57:59,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067679306] [2024-10-24 00:57:59,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067679306] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:57:59,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002221003] [2024-10-24 00:57:59,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:57:59,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:57:59,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:57:59,599 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-10-24 00:57:59,600 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-10-24 00:57:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:57:59,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 00:57:59,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:57:59,897 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 00:57:59,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:57:59,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002221003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:57:59,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:57:59,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-24 00:57:59,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49401897] [2024-10-24 00:57:59,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:57:59,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:57:59,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:57:59,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:57:59,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:57:59,899 INFO L87 Difference]: Start difference. First operand 366 states and 563 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:57:59,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:57:59,980 INFO L93 Difference]: Finished difference Result 727 states and 1120 transitions. [2024-10-24 00:57:59,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:57:59,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 104 [2024-10-24 00:57:59,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:57:59,985 INFO L225 Difference]: With dead ends: 727 [2024-10-24 00:57:59,985 INFO L226 Difference]: Without dead ends: 368 [2024-10-24 00:57:59,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:57:59,989 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 2 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:57:59,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1821 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:57:59,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-10-24 00:58:00,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2024-10-24 00:58:00,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 279 states have (on average 1.5663082437275986) internal successors, (437), 283 states have internal predecessors, (437), 64 states have call successors, (64), 23 states have call predecessors, (64), 24 states have return successors, (65), 63 states have call predecessors, (65), 63 states have call successors, (65) [2024-10-24 00:58:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 566 transitions. [2024-10-24 00:58:00,009 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 566 transitions. Word has length 104 [2024-10-24 00:58:00,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:00,010 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 566 transitions. [2024-10-24 00:58:00,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:58:00,010 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 566 transitions. [2024-10-24 00:58:00,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 00:58:00,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:00,012 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:00,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 00:58:00,213 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-10-24 00:58:00,213 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:00,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:00,213 INFO L85 PathProgramCache]: Analyzing trace with hash 689662902, now seen corresponding path program 1 times [2024-10-24 00:58:00,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:00,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924168206] [2024-10-24 00:58:00,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:00,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:00,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:00,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:00,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:00,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:00,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 00:58:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:00,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 00:58:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:00,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 00:58:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:00,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 00:58:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:00,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:58:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:00,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:58:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:00,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:58:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:00,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:58:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:00,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:58:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:58:00,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:00,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924168206] [2024-10-24 00:58:00,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924168206] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:58:00,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454807303] [2024-10-24 00:58:00,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:00,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:58:00,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:58:00,464 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-10-24 00:58:00,466 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-10-24 00:58:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:00,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 00:58:00,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:58:00,742 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 00:58:00,742 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:58:00,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454807303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:00,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:58:00,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-24 00:58:00,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174685442] [2024-10-24 00:58:00,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:00,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:58:00,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:00,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:58:00,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:58:00,744 INFO L87 Difference]: Start difference. First operand 368 states and 566 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:58:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:00,834 INFO L93 Difference]: Finished difference Result 729 states and 1125 transitions. [2024-10-24 00:58:00,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:58:00,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 105 [2024-10-24 00:58:00,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:00,836 INFO L225 Difference]: With dead ends: 729 [2024-10-24 00:58:00,837 INFO L226 Difference]: Without dead ends: 370 [2024-10-24 00:58:00,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:58:00,838 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 2 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:00,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1807 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:58:00,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-10-24 00:58:00,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2024-10-24 00:58:00,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 280 states have (on average 1.5642857142857143) internal successors, (438), 285 states have internal predecessors, (438), 64 states have call successors, (64), 23 states have call predecessors, (64), 25 states have return successors, (70), 63 states have call predecessors, (70), 63 states have call successors, (70) [2024-10-24 00:58:00,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 572 transitions. [2024-10-24 00:58:00,853 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 572 transitions. Word has length 105 [2024-10-24 00:58:00,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:00,853 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 572 transitions. [2024-10-24 00:58:00,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:58:00,853 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 572 transitions. [2024-10-24 00:58:00,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 00:58:00,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:00,855 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:00,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-24 00:58:01,059 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-10-24 00:58:01,060 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:01,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:01,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1907466066, now seen corresponding path program 1 times [2024-10-24 00:58:01,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:01,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60015829] [2024-10-24 00:58:01,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:01,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 00:58:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:58:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 00:58:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:58:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:58:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:58:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:58:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:58:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:58:01,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:01,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60015829] [2024-10-24 00:58:01,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60015829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:01,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:01,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:58:01,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19484344] [2024-10-24 00:58:01,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:01,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:58:01,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:01,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:58:01,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:58:01,210 INFO L87 Difference]: Start difference. First operand 370 states and 572 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:58:02,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:02,904 INFO L93 Difference]: Finished difference Result 807 states and 1260 transitions. [2024-10-24 00:58:02,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:58:02,905 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 106 [2024-10-24 00:58:02,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:02,908 INFO L225 Difference]: With dead ends: 807 [2024-10-24 00:58:02,908 INFO L226 Difference]: Without dead ends: 456 [2024-10-24 00:58:02,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:58:02,910 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1056 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:02,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 968 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 2109 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 00:58:02,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-10-24 00:58:02,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 370. [2024-10-24 00:58:02,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 280 states have (on average 1.5642857142857143) internal successors, (438), 285 states have internal predecessors, (438), 64 states have call successors, (64), 23 states have call predecessors, (64), 25 states have return successors, (69), 63 states have call predecessors, (69), 63 states have call successors, (69) [2024-10-24 00:58:02,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 571 transitions. [2024-10-24 00:58:02,965 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 571 transitions. Word has length 106 [2024-10-24 00:58:02,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:02,965 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 571 transitions. [2024-10-24 00:58:02,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:58:02,965 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 571 transitions. [2024-10-24 00:58:02,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 00:58:02,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:02,967 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:02,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 00:58:02,967 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:02,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:02,968 INFO L85 PathProgramCache]: Analyzing trace with hash -185036681, now seen corresponding path program 2 times [2024-10-24 00:58:02,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:02,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549292139] [2024-10-24 00:58:02,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:02,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 00:58:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:58:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 00:58:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:58:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:58:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:58:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:58:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:58:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:03,144 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:58:03,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:03,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549292139] [2024-10-24 00:58:03,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549292139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:03,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:03,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:58:03,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212107774] [2024-10-24 00:58:03,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:03,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:58:03,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:03,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:58:03,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:58:03,146 INFO L87 Difference]: Start difference. First operand 370 states and 571 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:58:04,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:04,720 INFO L93 Difference]: Finished difference Result 809 states and 1263 transitions. [2024-10-24 00:58:04,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:58:04,721 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 107 [2024-10-24 00:58:04,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:04,725 INFO L225 Difference]: With dead ends: 809 [2024-10-24 00:58:04,725 INFO L226 Difference]: Without dead ends: 458 [2024-10-24 00:58:04,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:58:04,727 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1084 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 2431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:04,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 968 Invalid, 2431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:58:04,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-10-24 00:58:04,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 372. [2024-10-24 00:58:04,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 281 states have (on average 1.5622775800711743) internal successors, (439), 287 states have internal predecessors, (439), 64 states have call successors, (64), 23 states have call predecessors, (64), 26 states have return successors, (71), 63 states have call predecessors, (71), 63 states have call successors, (71) [2024-10-24 00:58:04,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 574 transitions. [2024-10-24 00:58:04,755 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 574 transitions. Word has length 107 [2024-10-24 00:58:04,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:04,755 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 574 transitions. [2024-10-24 00:58:04,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:58:04,755 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 574 transitions. [2024-10-24 00:58:04,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 00:58:04,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:04,757 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:04,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 00:58:04,758 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:04,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:04,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1375191895, now seen corresponding path program 1 times [2024-10-24 00:58:04,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:04,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663196895] [2024-10-24 00:58:04,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:04,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:58:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 00:58:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:58:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:58:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:58:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:58:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:58:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:58:04,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:04,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663196895] [2024-10-24 00:58:04,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663196895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:04,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:04,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:58:04,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542746522] [2024-10-24 00:58:04,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:04,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:58:04,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:04,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:58:04,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:58:04,955 INFO L87 Difference]: Start difference. First operand 372 states and 574 transitions. Second operand has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 00:58:06,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:06,848 INFO L93 Difference]: Finished difference Result 807 states and 1258 transitions. [2024-10-24 00:58:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:58:06,849 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 108 [2024-10-24 00:58:06,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:06,852 INFO L225 Difference]: With dead ends: 807 [2024-10-24 00:58:06,852 INFO L226 Difference]: Without dead ends: 458 [2024-10-24 00:58:06,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-24 00:58:06,855 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 1121 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 3346 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 3722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 3346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:06,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 1343 Invalid, 3722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 3346 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 00:58:06,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-10-24 00:58:06,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 372. [2024-10-24 00:58:06,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 281 states have (on average 1.5622775800711743) internal successors, (439), 287 states have internal predecessors, (439), 64 states have call successors, (64), 23 states have call predecessors, (64), 26 states have return successors, (70), 63 states have call predecessors, (70), 63 states have call successors, (70) [2024-10-24 00:58:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 573 transitions. [2024-10-24 00:58:06,896 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 573 transitions. Word has length 108 [2024-10-24 00:58:06,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:06,897 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 573 transitions. [2024-10-24 00:58:06,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 00:58:06,897 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 573 transitions. [2024-10-24 00:58:06,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 00:58:06,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:06,900 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:06,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 00:58:06,900 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:06,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:06,901 INFO L85 PathProgramCache]: Analyzing trace with hash 620218143, now seen corresponding path program 2 times [2024-10-24 00:58:06,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:06,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525224588] [2024-10-24 00:58:06,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:06,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:58:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:58:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:58:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:58:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:58:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:58:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:58:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:07,139 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:58:07,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:07,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525224588] [2024-10-24 00:58:07,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525224588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:07,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:07,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:58:07,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452049365] [2024-10-24 00:58:07,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:07,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:58:07,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:07,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:58:07,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:58:07,143 INFO L87 Difference]: Start difference. First operand 372 states and 573 transitions. Second operand has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 00:58:09,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:09,080 INFO L93 Difference]: Finished difference Result 809 states and 1264 transitions. [2024-10-24 00:58:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:58:09,080 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 109 [2024-10-24 00:58:09,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:09,083 INFO L225 Difference]: With dead ends: 809 [2024-10-24 00:58:09,083 INFO L226 Difference]: Without dead ends: 460 [2024-10-24 00:58:09,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-24 00:58:09,086 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 1124 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 3373 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 3755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 3373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:09,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 1344 Invalid, 3755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 3373 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 00:58:09,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-10-24 00:58:09,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 374. [2024-10-24 00:58:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 282 states have (on average 1.5602836879432624) internal successors, (440), 289 states have internal predecessors, (440), 64 states have call successors, (64), 23 states have call predecessors, (64), 27 states have return successors, (75), 63 states have call predecessors, (75), 63 states have call successors, (75) [2024-10-24 00:58:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 579 transitions. [2024-10-24 00:58:09,111 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 579 transitions. Word has length 109 [2024-10-24 00:58:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:09,112 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 579 transitions. [2024-10-24 00:58:09,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 00:58:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 579 transitions. [2024-10-24 00:58:09,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 00:58:09,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:09,114 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:09,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 00:58:09,114 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:09,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:09,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1470402940, now seen corresponding path program 1 times [2024-10-24 00:58:09,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:09,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708543524] [2024-10-24 00:58:09,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:09,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 00:58:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:58:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:58:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:58:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:58:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:58:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:58:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,344 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-24 00:58:09,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:09,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708543524] [2024-10-24 00:58:09,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708543524] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:58:09,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723792452] [2024-10-24 00:58:09,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:09,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:58:09,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:58:09,347 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-10-24 00:58:09,349 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-10-24 00:58:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:09,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:58:09,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:58:09,641 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:09,641 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:58:09,724 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:09,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723792452] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:58:09,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:58:09,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-10-24 00:58:09,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976059077] [2024-10-24 00:58:09,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:58:09,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 00:58:09,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:09,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 00:58:09,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:58:09,726 INFO L87 Difference]: Start difference. First operand 374 states and 579 transitions. Second operand has 15 states, 14 states have (on average 8.714285714285714) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (31), 6 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-24 00:58:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:11,874 INFO L93 Difference]: Finished difference Result 1138 states and 1875 transitions. [2024-10-24 00:58:11,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 00:58:11,874 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 8.714285714285714) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (31), 6 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 110 [2024-10-24 00:58:11,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:11,879 INFO L225 Difference]: With dead ends: 1138 [2024-10-24 00:58:11,879 INFO L226 Difference]: Without dead ends: 790 [2024-10-24 00:58:11,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2024-10-24 00:58:11,883 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 2074 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 3850 mSolverCounterSat, 707 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2091 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 4557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 707 IncrementalHoareTripleChecker+Valid, 3850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:11,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2091 Valid, 1547 Invalid, 4557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [707 Valid, 3850 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 00:58:11,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-10-24 00:58:11,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 689. [2024-10-24 00:58:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 533 states have (on average 1.6097560975609757) internal successors, (858), 540 states have internal predecessors, (858), 128 states have call successors, (128), 23 states have call predecessors, (128), 27 states have return successors, (149), 127 states have call predecessors, (149), 127 states have call successors, (149) [2024-10-24 00:58:11,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1135 transitions. [2024-10-24 00:58:11,920 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1135 transitions. Word has length 110 [2024-10-24 00:58:11,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:11,921 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1135 transitions. [2024-10-24 00:58:11,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 8.714285714285714) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (31), 6 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-24 00:58:11,922 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1135 transitions. [2024-10-24 00:58:11,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 00:58:11,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:11,925 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:11,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 00:58:12,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:58:12,126 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:12,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:12,127 INFO L85 PathProgramCache]: Analyzing trace with hash 708690131, now seen corresponding path program 1 times [2024-10-24 00:58:12,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:12,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782044212] [2024-10-24 00:58:12,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:12,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:12,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:12,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:12,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:12,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:12,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:12,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:12,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:58:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:12,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:58:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:12,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:58:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:12,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:58:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:12,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:58:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:12,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:58:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:12,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 00:58:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:12,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:12,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782044212] [2024-10-24 00:58:12,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782044212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:12,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:12,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:58:12,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608704230] [2024-10-24 00:58:12,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:12,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:58:12,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:12,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:58:12,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:58:12,220 INFO L87 Difference]: Start difference. First operand 689 states and 1135 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:58:13,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:13,215 INFO L93 Difference]: Finished difference Result 1693 states and 2864 transitions. [2024-10-24 00:58:13,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:58:13,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2024-10-24 00:58:13,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:13,221 INFO L225 Difference]: With dead ends: 1693 [2024-10-24 00:58:13,222 INFO L226 Difference]: Without dead ends: 1072 [2024-10-24 00:58:13,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:58:13,224 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 1185 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:13,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 749 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 00:58:13,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-10-24 00:58:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 981. [2024-10-24 00:58:13,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 761 states have (on average 1.6228646517739815) internal successors, (1235), 768 states have internal predecessors, (1235), 192 states have call successors, (192), 23 states have call predecessors, (192), 27 states have return successors, (223), 191 states have call predecessors, (223), 191 states have call successors, (223) [2024-10-24 00:58:13,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1650 transitions. [2024-10-24 00:58:13,265 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1650 transitions. Word has length 114 [2024-10-24 00:58:13,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:13,265 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1650 transitions. [2024-10-24 00:58:13,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:58:13,266 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1650 transitions. [2024-10-24 00:58:13,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 00:58:13,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:13,270 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:13,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 00:58:13,270 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:13,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:13,270 INFO L85 PathProgramCache]: Analyzing trace with hash 366029075, now seen corresponding path program 1 times [2024-10-24 00:58:13,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:13,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363822836] [2024-10-24 00:58:13,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:13,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:58:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:58:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:58:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:58:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:58:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:58:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 00:58:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:13,358 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:13,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:13,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363822836] [2024-10-24 00:58:13,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363822836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:13,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:13,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:58:13,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494193379] [2024-10-24 00:58:13,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:13,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:58:13,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:13,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:58:13,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:58:13,360 INFO L87 Difference]: Start difference. First operand 981 states and 1650 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:58:14,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:14,514 INFO L93 Difference]: Finished difference Result 2410 states and 4121 transitions. [2024-10-24 00:58:14,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:58:14,515 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2024-10-24 00:58:14,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:14,523 INFO L225 Difference]: With dead ends: 2410 [2024-10-24 00:58:14,523 INFO L226 Difference]: Without dead ends: 1547 [2024-10-24 00:58:14,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:58:14,528 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 1208 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:14,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 710 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:58:14,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2024-10-24 00:58:14,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1456. [2024-10-24 00:58:14,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1141 states have (on average 1.6292725679228748) internal successors, (1859), 1148 states have internal predecessors, (1859), 287 states have call successors, (287), 23 states have call predecessors, (287), 27 states have return successors, (318), 286 states have call predecessors, (318), 286 states have call successors, (318) [2024-10-24 00:58:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 2464 transitions. [2024-10-24 00:58:14,593 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 2464 transitions. Word has length 115 [2024-10-24 00:58:14,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:14,593 INFO L471 AbstractCegarLoop]: Abstraction has 1456 states and 2464 transitions. [2024-10-24 00:58:14,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:58:14,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 2464 transitions. [2024-10-24 00:58:14,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 00:58:14,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:14,599 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:14,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 00:58:14,600 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:14,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:14,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1545428283, now seen corresponding path program 1 times [2024-10-24 00:58:14,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:14,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381987425] [2024-10-24 00:58:14,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:14,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:58:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:58:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:58:14,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:58:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:58:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:58:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 00:58:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:14,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:14,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381987425] [2024-10-24 00:58:14,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381987425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:14,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:14,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:58:14,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659943484] [2024-10-24 00:58:14,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:14,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:58:14,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:14,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:58:14,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:58:14,722 INFO L87 Difference]: Start difference. First operand 1456 states and 2464 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:58:15,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:15,705 INFO L93 Difference]: Finished difference Result 3472 states and 5999 transitions. [2024-10-24 00:58:15,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:58:15,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2024-10-24 00:58:15,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:15,716 INFO L225 Difference]: With dead ends: 3472 [2024-10-24 00:58:15,716 INFO L226 Difference]: Without dead ends: 2262 [2024-10-24 00:58:15,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:58:15,721 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 1196 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 426 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:15,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 702 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 00:58:15,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2024-10-24 00:58:15,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 2171. [2024-10-24 00:58:15,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2171 states, 1733 states have (on average 1.634737449509521) internal successors, (2833), 1740 states have internal predecessors, (2833), 410 states have call successors, (410), 23 states have call predecessors, (410), 27 states have return successors, (457), 409 states have call predecessors, (457), 409 states have call successors, (457) [2024-10-24 00:58:15,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 3700 transitions. [2024-10-24 00:58:15,813 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 3700 transitions. Word has length 116 [2024-10-24 00:58:15,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:15,813 INFO L471 AbstractCegarLoop]: Abstraction has 2171 states and 3700 transitions. [2024-10-24 00:58:15,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:58:15,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3700 transitions. [2024-10-24 00:58:15,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 00:58:15,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:15,821 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:15,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 00:58:15,821 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:15,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:15,821 INFO L85 PathProgramCache]: Analyzing trace with hash 220493074, now seen corresponding path program 1 times [2024-10-24 00:58:15,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:15,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541812865] [2024-10-24 00:58:15,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:15,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:58:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:58:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:58:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:58:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:58:15,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:58:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 00:58:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:15,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:15,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541812865] [2024-10-24 00:58:15,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541812865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:15,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:15,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:58:15,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548786] [2024-10-24 00:58:15,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:15,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:58:15,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:15,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:58:15,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:58:15,910 INFO L87 Difference]: Start difference. First operand 2171 states and 3700 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:58:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:16,871 INFO L93 Difference]: Finished difference Result 5114 states and 8912 transitions. [2024-10-24 00:58:16,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:58:16,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2024-10-24 00:58:16,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:16,885 INFO L225 Difference]: With dead ends: 5114 [2024-10-24 00:58:16,886 INFO L226 Difference]: Without dead ends: 3398 [2024-10-24 00:58:16,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:58:16,891 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1137 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:16,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 708 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 00:58:16,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2024-10-24 00:58:16,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3307. [2024-10-24 00:58:16,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3307 states, 2690 states have (on average 1.6382899628252787) internal successors, (4407), 2697 states have internal predecessors, (4407), 589 states have call successors, (589), 23 states have call predecessors, (589), 27 states have return successors, (662), 588 states have call predecessors, (662), 588 states have call successors, (662) [2024-10-24 00:58:16,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3307 states to 3307 states and 5658 transitions. [2024-10-24 00:58:17,000 INFO L78 Accepts]: Start accepts. Automaton has 3307 states and 5658 transitions. Word has length 117 [2024-10-24 00:58:17,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:17,000 INFO L471 AbstractCegarLoop]: Abstraction has 3307 states and 5658 transitions. [2024-10-24 00:58:17,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:58:17,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3307 states and 5658 transitions. [2024-10-24 00:58:17,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 00:58:17,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:17,010 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:17,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 00:58:17,010 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:17,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:17,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1500640567, now seen corresponding path program 1 times [2024-10-24 00:58:17,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:17,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164627767] [2024-10-24 00:58:17,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:17,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:58:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:58:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:58:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:58:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:58:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 00:58:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 00:58:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:17,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:17,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164627767] [2024-10-24 00:58:17,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164627767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:17,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:17,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:58:17,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406436761] [2024-10-24 00:58:17,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:17,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:58:17,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:17,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:58:17,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:58:17,092 INFO L87 Difference]: Start difference. First operand 3307 states and 5658 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:58:18,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:18,220 INFO L93 Difference]: Finished difference Result 8069 states and 14110 transitions. [2024-10-24 00:58:18,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:58:18,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2024-10-24 00:58:18,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:18,246 INFO L225 Difference]: With dead ends: 8069 [2024-10-24 00:58:18,246 INFO L226 Difference]: Without dead ends: 5456 [2024-10-24 00:58:18,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:58:18,256 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 1157 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:18,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 741 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:58:18,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5456 states. [2024-10-24 00:58:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5456 to 5365. [2024-10-24 00:58:18,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5365 states, 4372 states have (on average 1.630832570905764) internal successors, (7130), 4379 states have internal predecessors, (7130), 965 states have call successors, (965), 23 states have call predecessors, (965), 27 states have return successors, (1082), 964 states have call predecessors, (1082), 964 states have call successors, (1082) [2024-10-24 00:58:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5365 states to 5365 states and 9177 transitions. [2024-10-24 00:58:18,504 INFO L78 Accepts]: Start accepts. Automaton has 5365 states and 9177 transitions. Word has length 118 [2024-10-24 00:58:18,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:18,504 INFO L471 AbstractCegarLoop]: Abstraction has 5365 states and 9177 transitions. [2024-10-24 00:58:18,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:58:18,505 INFO L276 IsEmpty]: Start isEmpty. Operand 5365 states and 9177 transitions. [2024-10-24 00:58:18,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 00:58:18,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:18,521 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:18,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 00:58:18,521 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:18,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:18,522 INFO L85 PathProgramCache]: Analyzing trace with hash 265728270, now seen corresponding path program 1 times [2024-10-24 00:58:18,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:18,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659554301] [2024-10-24 00:58:18,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:18,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:18,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:18,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:18,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:18,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:18,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:18,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:18,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:58:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:18,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:58:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:18,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:58:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:18,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:58:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:18,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:58:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:18,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 00:58:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:18,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 00:58:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:18,623 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:18,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:18,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659554301] [2024-10-24 00:58:18,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659554301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:18,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:18,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:58:18,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872843259] [2024-10-24 00:58:18,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:18,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:58:18,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:18,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:58:18,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:58:18,627 INFO L87 Difference]: Start difference. First operand 5365 states and 9177 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:58:19,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:19,862 INFO L93 Difference]: Finished difference Result 13274 states and 23194 transitions. [2024-10-24 00:58:19,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:58:19,863 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 119 [2024-10-24 00:58:19,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:19,913 INFO L225 Difference]: With dead ends: 13274 [2024-10-24 00:58:19,914 INFO L226 Difference]: Without dead ends: 8989 [2024-10-24 00:58:19,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:58:19,932 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 1158 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:19,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 721 Invalid, 1618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:58:19,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8989 states. [2024-10-24 00:58:20,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8989 to 8898. [2024-10-24 00:58:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8898 states, 7299 states have (on average 1.628579257432525) internal successors, (11887), 7306 states have internal predecessors, (11887), 1571 states have call successors, (1571), 23 states have call predecessors, (1571), 27 states have return successors, (1766), 1570 states have call predecessors, (1766), 1570 states have call successors, (1766) [2024-10-24 00:58:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8898 states to 8898 states and 15224 transitions. [2024-10-24 00:58:20,281 INFO L78 Accepts]: Start accepts. Automaton has 8898 states and 15224 transitions. Word has length 119 [2024-10-24 00:58:20,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:20,282 INFO L471 AbstractCegarLoop]: Abstraction has 8898 states and 15224 transitions. [2024-10-24 00:58:20,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:58:20,282 INFO L276 IsEmpty]: Start isEmpty. Operand 8898 states and 15224 transitions. [2024-10-24 00:58:20,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 00:58:20,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:20,301 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:20,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 00:58:20,301 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:20,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:20,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1249059143, now seen corresponding path program 1 times [2024-10-24 00:58:20,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:20,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165143642] [2024-10-24 00:58:20,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:20,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:58:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:58:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:58:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:58:20,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:58:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 00:58:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 00:58:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:20,395 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:20,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:20,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165143642] [2024-10-24 00:58:20,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165143642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:20,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:20,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:58:20,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545715736] [2024-10-24 00:58:20,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:20,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:58:20,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:20,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:58:20,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:58:20,397 INFO L87 Difference]: Start difference. First operand 8898 states and 15224 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:58:21,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:21,692 INFO L93 Difference]: Finished difference Result 23046 states and 40223 transitions. [2024-10-24 00:58:21,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:58:21,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2024-10-24 00:58:21,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:21,752 INFO L225 Difference]: With dead ends: 23046 [2024-10-24 00:58:21,752 INFO L226 Difference]: Without dead ends: 15661 [2024-10-24 00:58:21,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:58:21,783 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 1134 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:21,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 716 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 00:58:21,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15661 states. [2024-10-24 00:58:22,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15661 to 15570. [2024-10-24 00:58:22,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15570 states, 12768 states have (on average 1.619360902255639) internal successors, (20676), 12775 states have internal predecessors, (20676), 2774 states have call successors, (2774), 23 states have call predecessors, (2774), 27 states have return successors, (3113), 2773 states have call predecessors, (3113), 2773 states have call successors, (3113) [2024-10-24 00:58:22,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15570 states to 15570 states and 26563 transitions. [2024-10-24 00:58:22,368 INFO L78 Accepts]: Start accepts. Automaton has 15570 states and 26563 transitions. Word has length 120 [2024-10-24 00:58:22,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:22,369 INFO L471 AbstractCegarLoop]: Abstraction has 15570 states and 26563 transitions. [2024-10-24 00:58:22,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:58:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 15570 states and 26563 transitions. [2024-10-24 00:58:22,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 00:58:22,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:22,399 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:22,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 00:58:22,401 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:22,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:22,401 INFO L85 PathProgramCache]: Analyzing trace with hash -918583955, now seen corresponding path program 1 times [2024-10-24 00:58:22,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:22,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844267780] [2024-10-24 00:58:22,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:22,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:22,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:22,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:22,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:22,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:22,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:22,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:22,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:58:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:22,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:58:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:22,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:58:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:22,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:58:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:22,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:58:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:22,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 00:58:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:22,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 00:58:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:22,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:22,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844267780] [2024-10-24 00:58:22,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844267780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:22,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:22,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:58:22,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025014924] [2024-10-24 00:58:22,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:22,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:58:22,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:22,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:58:22,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:58:22,498 INFO L87 Difference]: Start difference. First operand 15570 states and 26563 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:58:24,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:24,066 INFO L93 Difference]: Finished difference Result 41213 states and 71821 transitions. [2024-10-24 00:58:24,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:58:24,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2024-10-24 00:58:24,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:24,179 INFO L225 Difference]: With dead ends: 41213 [2024-10-24 00:58:24,179 INFO L226 Difference]: Without dead ends: 27776 [2024-10-24 00:58:24,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:58:24,222 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1166 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:24,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 709 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:58:24,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27776 states. [2024-10-24 00:58:25,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27776 to 27685. [2024-10-24 00:58:25,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27685 states, 22844 states have (on average 1.6154351251969883) internal successors, (36903), 22851 states have internal predecessors, (36903), 4813 states have call successors, (4813), 23 states have call predecessors, (4813), 27 states have return successors, (5426), 4812 states have call predecessors, (5426), 4812 states have call successors, (5426) [2024-10-24 00:58:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27685 states to 27685 states and 47142 transitions. [2024-10-24 00:58:25,295 INFO L78 Accepts]: Start accepts. Automaton has 27685 states and 47142 transitions. Word has length 121 [2024-10-24 00:58:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:25,295 INFO L471 AbstractCegarLoop]: Abstraction has 27685 states and 47142 transitions. [2024-10-24 00:58:25,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:58:25,296 INFO L276 IsEmpty]: Start isEmpty. Operand 27685 states and 47142 transitions. [2024-10-24 00:58:25,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 00:58:25,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:25,319 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:25,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 00:58:25,319 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:25,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:25,319 INFO L85 PathProgramCache]: Analyzing trace with hash -274345115, now seen corresponding path program 1 times [2024-10-24 00:58:25,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:25,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110789178] [2024-10-24 00:58:25,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:25,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:58:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:58:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:58:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:58:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:58:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 00:58:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 00:58:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:25,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:25,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110789178] [2024-10-24 00:58:25,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110789178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:25,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:25,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:58:25,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961394629] [2024-10-24 00:58:25,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:25,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:58:25,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:25,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:58:25,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:58:25,408 INFO L87 Difference]: Start difference. First operand 27685 states and 47142 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:58:27,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:27,364 INFO L93 Difference]: Finished difference Result 75405 states and 130615 transitions. [2024-10-24 00:58:27,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:58:27,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2024-10-24 00:58:27,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:27,563 INFO L225 Difference]: With dead ends: 75405 [2024-10-24 00:58:27,564 INFO L226 Difference]: Without dead ends: 50600 [2024-10-24 00:58:27,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:58:27,754 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1125 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:27,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 710 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 00:58:27,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50600 states. [2024-10-24 00:58:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50600 to 50509. [2024-10-24 00:58:29,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50509 states, 41953 states have (on average 1.6101589874383238) internal successors, (67551), 41960 states have internal predecessors, (67551), 8528 states have call successors, (8528), 23 states have call predecessors, (8528), 27 states have return successors, (9673), 8527 states have call predecessors, (9673), 8527 states have call successors, (9673) [2024-10-24 00:58:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50509 states to 50509 states and 85752 transitions. [2024-10-24 00:58:29,664 INFO L78 Accepts]: Start accepts. Automaton has 50509 states and 85752 transitions. Word has length 122 [2024-10-24 00:58:29,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:29,665 INFO L471 AbstractCegarLoop]: Abstraction has 50509 states and 85752 transitions. [2024-10-24 00:58:29,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:58:29,665 INFO L276 IsEmpty]: Start isEmpty. Operand 50509 states and 85752 transitions. [2024-10-24 00:58:29,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-24 00:58:29,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:29,692 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:29,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 00:58:29,693 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:29,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:29,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1604285939, now seen corresponding path program 1 times [2024-10-24 00:58:29,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:29,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817731933] [2024-10-24 00:58:29,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:29,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:29,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:29,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:29,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:29,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:29,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:29,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:29,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:58:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:29,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:58:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:29,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:58:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:29,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:58:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:29,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:58:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:29,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 00:58:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:29,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 00:58:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:29,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:29,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817731933] [2024-10-24 00:58:29,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817731933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:29,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:29,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:58:29,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301686337] [2024-10-24 00:58:29,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:29,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:58:29,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:29,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:58:29,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:58:29,783 INFO L87 Difference]: Start difference. First operand 50509 states and 85752 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:58:32,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:32,732 INFO L93 Difference]: Finished difference Result 94152 states and 163521 transitions. [2024-10-24 00:58:32,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:58:32,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2024-10-24 00:58:32,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:33,055 INFO L225 Difference]: With dead ends: 94152 [2024-10-24 00:58:33,055 INFO L226 Difference]: Without dead ends: 93980 [2024-10-24 00:58:33,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:58:33,085 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 1125 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:33,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1139 Valid, 712 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 00:58:33,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93980 states. [2024-10-24 00:58:36,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93980 to 93889. [2024-10-24 00:58:36,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93889 states, 78534 states have (on average 1.6033692413476965) internal successors, (125919), 78541 states have internal predecessors, (125919), 15327 states have call successors, (15327), 23 states have call predecessors, (15327), 27 states have return successors, (17518), 15326 states have call predecessors, (17518), 15326 states have call successors, (17518) [2024-10-24 00:58:36,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93889 states to 93889 states and 158764 transitions. [2024-10-24 00:58:36,769 INFO L78 Accepts]: Start accepts. Automaton has 93889 states and 158764 transitions. Word has length 123 [2024-10-24 00:58:36,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:36,770 INFO L471 AbstractCegarLoop]: Abstraction has 93889 states and 158764 transitions. [2024-10-24 00:58:36,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:58:36,770 INFO L276 IsEmpty]: Start isEmpty. Operand 93889 states and 158764 transitions. [2024-10-24 00:58:37,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 00:58:37,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:37,105 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:37,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 00:58:37,105 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:37,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:37,105 INFO L85 PathProgramCache]: Analyzing trace with hash 680262534, now seen corresponding path program 1 times [2024-10-24 00:58:37,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:37,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517270906] [2024-10-24 00:58:37,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:37,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:37,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:37,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:37,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:37,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:37,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:37,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:37,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:58:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:37,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:58:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:37,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:58:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:37,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:58:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:37,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:58:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:37,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 00:58:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:37,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 00:58:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:37,482 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:37,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:37,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517270906] [2024-10-24 00:58:37,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517270906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:37,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:37,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-24 00:58:37,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563883550] [2024-10-24 00:58:37,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:37,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 00:58:37,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:37,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 00:58:37,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2024-10-24 00:58:37,485 INFO L87 Difference]: Start difference. First operand 93889 states and 158764 transitions. Second operand has 18 states, 16 states have (on average 5.1875) internal successors, (83), 12 states have internal predecessors, (83), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-10-24 00:58:45,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:58:45,994 INFO L93 Difference]: Finished difference Result 187571 states and 329127 transitions. [2024-10-24 00:58:45,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-24 00:58:45,995 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.1875) internal successors, (83), 12 states have internal predecessors, (83), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 124 [2024-10-24 00:58:45,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:58:46,813 INFO L225 Difference]: With dead ends: 187571 [2024-10-24 00:58:46,813 INFO L226 Difference]: Without dead ends: 187404 [2024-10-24 00:58:46,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1486 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=863, Invalid=3967, Unknown=0, NotChecked=0, Total=4830 [2024-10-24 00:58:46,892 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 4472 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 6332 mSolverCounterSat, 1635 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4483 SdHoareTripleChecker+Valid, 2302 SdHoareTripleChecker+Invalid, 7967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1635 IncrementalHoareTripleChecker+Valid, 6332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:58:46,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4483 Valid, 2302 Invalid, 7967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1635 Valid, 6332 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-24 00:58:47,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187404 states. [2024-10-24 00:58:53,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187404 to 187002. [2024-10-24 00:58:54,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187002 states, 156479 states have (on average 1.6042791684507187) internal successors, (251036), 156384 states have internal predecessors, (251036), 30451 states have call successors, (30451), 62 states have call predecessors, (30451), 71 states have return successors, (38109), 30561 states have call predecessors, (38109), 30448 states have call successors, (38109) [2024-10-24 00:58:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187002 states to 187002 states and 319596 transitions. [2024-10-24 00:58:55,174 INFO L78 Accepts]: Start accepts. Automaton has 187002 states and 319596 transitions. Word has length 124 [2024-10-24 00:58:55,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:58:55,175 INFO L471 AbstractCegarLoop]: Abstraction has 187002 states and 319596 transitions. [2024-10-24 00:58:55,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.1875) internal successors, (83), 12 states have internal predecessors, (83), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-10-24 00:58:55,175 INFO L276 IsEmpty]: Start isEmpty. Operand 187002 states and 319596 transitions. [2024-10-24 00:58:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 00:58:55,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:58:55,258 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:58:55,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 00:58:55,258 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:58:55,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:58:55,258 INFO L85 PathProgramCache]: Analyzing trace with hash 500238423, now seen corresponding path program 1 times [2024-10-24 00:58:55,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:58:55,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424599416] [2024-10-24 00:58:55,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:58:55,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:58:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:55,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:58:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:55,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:58:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:55,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:58:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:55,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:58:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:55,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:58:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:55,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:58:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:55,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:58:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:55,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:58:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:55,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:58:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:55,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:58:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:55,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:58:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:55,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 00:58:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:55,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 00:58:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:58:55,461 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:58:55,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:58:55,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424599416] [2024-10-24 00:58:55,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424599416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:58:55,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:58:55,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 00:58:55,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7126335] [2024-10-24 00:58:55,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:58:55,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 00:58:55,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:58:55,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 00:58:55,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:58:55,463 INFO L87 Difference]: Start difference. First operand 187002 states and 319596 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 8 states have internal predecessors, (84), 5 states have call successors, (15), 7 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-24 00:59:02,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:59:02,146 INFO L93 Difference]: Finished difference Result 188174 states and 327896 transitions. [2024-10-24 00:59:02,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-24 00:59:02,146 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 8 states have internal predecessors, (84), 5 states have call successors, (15), 7 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 125 [2024-10-24 00:59:02,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:59:03,032 INFO L225 Difference]: With dead ends: 188174 [2024-10-24 00:59:03,033 INFO L226 Difference]: Without dead ends: 187352 [2024-10-24 00:59:03,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2024-10-24 00:59:03,097 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 2021 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 3832 mSolverCounterSat, 746 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2036 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 4578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 746 IncrementalHoareTripleChecker+Valid, 3832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:59:03,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2036 Valid, 1412 Invalid, 4578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [746 Valid, 3832 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 00:59:03,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187352 states.