./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_spec7_product19.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_spec7_product19.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 7a4e3d1ef75cde0243f57ce4bcedb5827704adb835017a69deaa6c50c3201720 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 00:54:14,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 00:54:15,042 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 00:54:15,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 00:54:15,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 00:54:15,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 00:54:15,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 00:54:15,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 00:54:15,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 00:54:15,071 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 00:54:15,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 00:54:15,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 00:54:15,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 00:54:15,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 00:54:15,076 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 00:54:15,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 00:54:15,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 00:54:15,077 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 00:54:15,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 00:54:15,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 00:54:15,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 00:54:15,082 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 00:54:15,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 00:54:15,083 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 00:54:15,083 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 00:54:15,083 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 00:54:15,083 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 00:54:15,084 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 00:54:15,084 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 00:54:15,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 00:54:15,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 00:54:15,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 00:54:15,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:54:15,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 00:54:15,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 00:54:15,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 00:54:15,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 00:54:15,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 00:54:15,086 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 00:54:15,088 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 00:54:15,088 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 00:54:15,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 00:54:15,089 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 -> 7a4e3d1ef75cde0243f57ce4bcedb5827704adb835017a69deaa6c50c3201720 [2024-10-24 00:54:15,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 00:54:15,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 00:54:15,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 00:54:15,351 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 00:54:15,352 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 00:54:15,353 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product19.cil.c [2024-10-24 00:54:16,855 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 00:54:17,154 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 00:54:17,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product19.cil.c [2024-10-24 00:54:17,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1774a447b/24f5088ed14b44ae9524f21d52d9ede7/FLAG5a5a105de [2024-10-24 00:54:17,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1774a447b/24f5088ed14b44ae9524f21d52d9ede7 [2024-10-24 00:54:17,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 00:54:17,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 00:54:17,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 00:54:17,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 00:54:17,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 00:54:17,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:54:17" (1/1) ... [2024-10-24 00:54:17,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10870392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:17, skipping insertion in model container [2024-10-24 00:54:17,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:54:17" (1/1) ... [2024-10-24 00:54:17,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 00:54:17,910 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_spec7_product19.cil.c[37206,37219] [2024-10-24 00:54:17,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:54:18,006 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 00:54:18,016 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptVerify_spec.i","") [48] [2024-10-24 00:54:18,018 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [79] [2024-10-24 00:54:18,019 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [97] [2024-10-24 00:54:18,019 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [509] [2024-10-24 00:54:18,019 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [547] [2024-10-24 00:54:18,019 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [913] [2024-10-24 00:54:18,019 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1138] [2024-10-24 00:54:18,020 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1236] [2024-10-24 00:54:18,020 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1533] [2024-10-24 00:54:18,020 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1815] [2024-10-24 00:54:18,020 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1824] [2024-10-24 00:54:18,100 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_spec7_product19.cil.c[37206,37219] [2024-10-24 00:54:18,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:54:18,176 INFO L204 MainTranslator]: Completed translation [2024-10-24 00:54:18,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18 WrapperNode [2024-10-24 00:54:18,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 00:54:18,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 00:54:18,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 00:54:18,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 00:54:18,186 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:54:18" (1/1) ... [2024-10-24 00:54:18,223 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:54:18" (1/1) ... [2024-10-24 00:54:18,293 INFO L138 Inliner]: procedures = 127, calls = 184, calls flagged for inlining = 60, calls inlined = 55, statements flattened = 1003 [2024-10-24 00:54:18,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 00:54:18,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 00:54:18,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 00:54:18,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 00:54:18,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18" (1/1) ... [2024-10-24 00:54:18,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18" (1/1) ... [2024-10-24 00:54:18,316 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18" (1/1) ... [2024-10-24 00:54:18,356 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:54:18,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18" (1/1) ... [2024-10-24 00:54:18,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18" (1/1) ... [2024-10-24 00:54:18,373 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18" (1/1) ... [2024-10-24 00:54:18,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18" (1/1) ... [2024-10-24 00:54:18,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18" (1/1) ... [2024-10-24 00:54:18,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18" (1/1) ... [2024-10-24 00:54:18,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 00:54:18,421 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 00:54:18,422 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 00:54:18,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 00:54:18,422 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18" (1/1) ... [2024-10-24 00:54:18,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:54:18,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:54:18,466 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:54:18,473 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:54:18,520 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-24 00:54:18,520 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-24 00:54:18,520 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-24 00:54:18,520 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-24 00:54:18,520 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-24 00:54:18,521 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-24 00:54:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-24 00:54:18,521 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-24 00:54:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-24 00:54:18,521 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-24 00:54:18,522 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-24 00:54:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-24 00:54:18,522 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-24 00:54:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-24 00:54:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-24 00:54:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-24 00:54:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 00:54:18,524 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-24 00:54:18,524 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-24 00:54:18,524 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-24 00:54:18,524 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-24 00:54:18,526 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-24 00:54:18,526 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-24 00:54:18,526 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-24 00:54:18,526 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-24 00:54:18,526 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-24 00:54:18,527 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-24 00:54:18,527 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-24 00:54:18,527 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-24 00:54:18,527 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-24 00:54:18,527 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-24 00:54:18,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 00:54:18,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 00:54:18,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 00:54:18,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 00:54:18,527 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-24 00:54:18,527 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-24 00:54:18,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 00:54:18,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 00:54:18,719 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 00:54:18,722 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 00:54:19,591 INFO L? ?]: Removed 433 outVars from TransFormulas that were not future-live. [2024-10-24 00:54:19,591 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 00:54:19,659 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 00:54:19,662 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 00:54:19,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:54:19 BoogieIcfgContainer [2024-10-24 00:54:19,662 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 00:54:19,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 00:54:19,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 00:54:19,669 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 00:54:19,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:54:17" (1/3) ... [2024-10-24 00:54:19,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3baf854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:54:19, skipping insertion in model container [2024-10-24 00:54:19,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:18" (2/3) ... [2024-10-24 00:54:19,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3baf854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:54:19, skipping insertion in model container [2024-10-24 00:54:19,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:54:19" (3/3) ... [2024-10-24 00:54:19,673 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec7_product19.cil.c [2024-10-24 00:54:19,691 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 00:54:19,692 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 00:54:19,759 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 00:54:19,766 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;@adacf3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 00:54:19,766 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 00:54:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand has 273 states, 213 states have (on average 1.6056338028169015) internal successors, (342), 215 states have internal predecessors, (342), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-24 00:54:19,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 00:54:19,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:19,788 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] [2024-10-24 00:54:19,789 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:19,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:19,793 INFO L85 PathProgramCache]: Analyzing trace with hash -200313171, now seen corresponding path program 1 times [2024-10-24 00:54:19,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:19,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204546964] [2024-10-24 00:54:19,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:19,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:20,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:20,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:20,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:20,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:54:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:20,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:54:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:20,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:54:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:20,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 00:54:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:20,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 00:54:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:20,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:54:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:20,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:54:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:20,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:54:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:20,586 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:54:20,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:20,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204546964] [2024-10-24 00:54:20,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204546964] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:54:20,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330562503] [2024-10-24 00:54:20,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:20,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:54:20,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:54:20,592 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:54:20,593 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:54:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:20,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 00:54:20,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:54:20,936 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:54:20,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:54:20,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330562503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:54:20,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:54:20,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-24 00:54:20,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972194603] [2024-10-24 00:54:20,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:54:20,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 00:54:20,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:20,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 00:54:20,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:54:20,980 INFO L87 Difference]: Start difference. First operand has 273 states, 213 states have (on average 1.6056338028169015) internal successors, (342), 215 states have internal predecessors, (342), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:21,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:21,086 INFO L93 Difference]: Finished difference Result 401 states and 615 transitions. [2024-10-24 00:54:21,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 00:54:21,090 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 79 [2024-10-24 00:54:21,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:21,108 INFO L225 Difference]: With dead ends: 401 [2024-10-24 00:54:21,108 INFO L226 Difference]: Without dead ends: 270 [2024-10-24 00:54:21,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 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:54:21,121 INFO L432 NwaCegarLoop]: 407 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:21,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 407 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:54:21,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-24 00:54:21,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2024-10-24 00:54:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 211 states have (on average 1.5876777251184835) internal successors, (335), 212 states have internal predecessors, (335), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 00:54:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 418 transitions. [2024-10-24 00:54:21,203 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 418 transitions. Word has length 79 [2024-10-24 00:54:21,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:21,205 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 418 transitions. [2024-10-24 00:54:21,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:21,205 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 418 transitions. [2024-10-24 00:54:21,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 00:54:21,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:21,211 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] [2024-10-24 00:54:21,229 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:54:21,411 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:54:21,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:21,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:21,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1688298610, now seen corresponding path program 1 times [2024-10-24 00:54:21,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:21,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404493501] [2024-10-24 00:54:21,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:21,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:21,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:21,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:21,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:21,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:54:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:21,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:54:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:21,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:54:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:21,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:54:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:21,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 00:54:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:21,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:54:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:21,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:54:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:21,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:54:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:21,765 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:54:21,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:21,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404493501] [2024-10-24 00:54:21,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404493501] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:54:21,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989723515] [2024-10-24 00:54:21,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:21,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:54:21,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:54:21,774 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:54:21,776 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:54:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:22,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 00:54:22,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:54:22,126 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:54:22,129 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:54:22,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989723515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:54:22,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:54:22,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 00:54:22,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224558688] [2024-10-24 00:54:22,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:54:22,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:54:22,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:22,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:54:22,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:54:22,135 INFO L87 Difference]: Start difference. First operand 270 states and 418 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:22,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:22,217 INFO L93 Difference]: Finished difference Result 397 states and 602 transitions. [2024-10-24 00:54:22,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:54:22,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 80 [2024-10-24 00:54:22,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:22,224 INFO L225 Difference]: With dead ends: 397 [2024-10-24 00:54:22,224 INFO L226 Difference]: Without dead ends: 272 [2024-10-24 00:54:22,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 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:54:22,227 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 0 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:22,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 807 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:54:22,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-24 00:54:22,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2024-10-24 00:54:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 213 states have (on average 1.5821596244131455) internal successors, (337), 214 states have internal predecessors, (337), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 00:54:22,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 420 transitions. [2024-10-24 00:54:22,248 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 420 transitions. Word has length 80 [2024-10-24 00:54:22,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:22,249 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 420 transitions. [2024-10-24 00:54:22,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:22,249 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 420 transitions. [2024-10-24 00:54:22,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 00:54:22,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:22,252 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] [2024-10-24 00:54:22,275 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:54:22,453 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:54:22,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:22,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:22,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1495994238, now seen corresponding path program 1 times [2024-10-24 00:54:22,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:22,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795389325] [2024-10-24 00:54:22,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:22,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:22,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:22,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:22,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:22,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:54:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:22,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:54:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:22,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:54:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:22,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 00:54:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:22,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:54:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:22,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:54:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:22,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:54:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:22,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:54:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:22,697 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:54:22,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:22,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795389325] [2024-10-24 00:54:22,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795389325] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:54:22,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726764903] [2024-10-24 00:54:22,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:22,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:54:22,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:54:22,700 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:54:22,701 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:54:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:22,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:54:22,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:54:22,998 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:54:22,998 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:54:22,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726764903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:54:22,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:54:22,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 00:54:22,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124531105] [2024-10-24 00:54:22,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:54:23,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:54:23,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:23,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:54:23,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:54:23,001 INFO L87 Difference]: Start difference. First operand 272 states and 420 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:23,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:23,093 INFO L93 Difference]: Finished difference Result 574 states and 899 transitions. [2024-10-24 00:54:23,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:54:23,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 85 [2024-10-24 00:54:23,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:23,097 INFO L225 Difference]: With dead ends: 574 [2024-10-24 00:54:23,098 INFO L226 Difference]: Without dead ends: 324 [2024-10-24 00:54:23,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 102 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:54:23,100 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 102 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:23,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 778 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:54:23,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-24 00:54:23,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 319. [2024-10-24 00:54:23,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 249 states have (on average 1.5943775100401607) internal successors, (397), 250 states have internal predecessors, (397), 53 states have call successors, (53), 16 states have call predecessors, (53), 16 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 00:54:23,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 502 transitions. [2024-10-24 00:54:23,135 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 502 transitions. Word has length 85 [2024-10-24 00:54:23,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:23,136 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 502 transitions. [2024-10-24 00:54:23,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:23,136 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 502 transitions. [2024-10-24 00:54:23,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 00:54:23,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:23,141 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] [2024-10-24 00:54:23,161 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:54:23,342 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:54:23,343 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:23,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:23,343 INFO L85 PathProgramCache]: Analyzing trace with hash 148472143, now seen corresponding path program 1 times [2024-10-24 00:54:23,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:23,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423732547] [2024-10-24 00:54:23,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:23,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:23,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:23,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:23,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:23,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:54:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:23,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:54:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:23,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:54:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:23,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 00:54:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:23,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:54:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:23,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:54:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:23,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:54:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:23,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:54:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:23,590 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:54:23,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:23,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423732547] [2024-10-24 00:54:23,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423732547] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:54:23,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447036144] [2024-10-24 00:54:23,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:23,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:54:23,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:54:23,595 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:54:23,597 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:54:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:23,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 00:54:23,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:54:23,947 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:54:23,947 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:54:23,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447036144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:54:23,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:54:23,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-24 00:54:23,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16497387] [2024-10-24 00:54:23,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:54:23,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:54:23,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:23,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:54:23,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:54:23,951 INFO L87 Difference]: Start difference. First operand 319 states and 502 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:54:24,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:24,060 INFO L93 Difference]: Finished difference Result 633 states and 998 transitions. [2024-10-24 00:54:24,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:54:24,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 86 [2024-10-24 00:54:24,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:24,064 INFO L225 Difference]: With dead ends: 633 [2024-10-24 00:54:24,064 INFO L226 Difference]: Without dead ends: 321 [2024-10-24 00:54:24,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 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:54:24,070 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 2 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:24,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1573 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:54:24,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-24 00:54:24,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2024-10-24 00:54:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 250 states have (on average 1.592) internal successors, (398), 252 states have internal predecessors, (398), 53 states have call successors, (53), 16 states have call predecessors, (53), 17 states have return successors, (54), 52 states have call predecessors, (54), 52 states have call successors, (54) [2024-10-24 00:54:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 505 transitions. [2024-10-24 00:54:24,095 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 505 transitions. Word has length 86 [2024-10-24 00:54:24,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:24,095 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 505 transitions. [2024-10-24 00:54:24,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:54:24,095 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 505 transitions. [2024-10-24 00:54:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 00:54:24,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:24,097 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] [2024-10-24 00:54:24,116 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:54:24,297 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:54:24,298 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:24,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:24,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1324664892, now seen corresponding path program 1 times [2024-10-24 00:54:24,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:24,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630418433] [2024-10-24 00:54:24,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:24,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:24,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:24,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:24,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:24,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:54:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:24,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 00:54:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:24,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 00:54:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:24,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 00:54:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:24,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:54:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:24,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:54:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:24,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:54:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:24,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:54:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:24,559 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:54:24,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:24,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630418433] [2024-10-24 00:54:24,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630418433] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:54:24,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091964345] [2024-10-24 00:54:24,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:24,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:54:24,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:54:24,561 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:54:24,563 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:54:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:24,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 00:54:24,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:54:24,873 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:54:24,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:54:24,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091964345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:54:24,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:54:24,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-24 00:54:24,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084557047] [2024-10-24 00:54:24,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:54:24,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:54:24,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:24,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:54:24,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:54:24,876 INFO L87 Difference]: Start difference. First operand 321 states and 505 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:54:24,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:24,970 INFO L93 Difference]: Finished difference Result 635 states and 1003 transitions. [2024-10-24 00:54:24,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:54:24,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 87 [2024-10-24 00:54:24,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:24,973 INFO L225 Difference]: With dead ends: 635 [2024-10-24 00:54:24,974 INFO L226 Difference]: Without dead ends: 323 [2024-10-24 00:54:24,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 101 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:54:24,976 INFO L432 NwaCegarLoop]: 394 mSDtfsCounter, 2 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:24,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1559 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:54:24,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-10-24 00:54:24,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2024-10-24 00:54:24,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 251 states have (on average 1.5896414342629481) internal successors, (399), 254 states have internal predecessors, (399), 53 states have call successors, (53), 16 states have call predecessors, (53), 18 states have return successors, (59), 52 states have call predecessors, (59), 52 states have call successors, (59) [2024-10-24 00:54:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 511 transitions. [2024-10-24 00:54:24,990 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 511 transitions. Word has length 87 [2024-10-24 00:54:24,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:24,990 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 511 transitions. [2024-10-24 00:54:24,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:54:24,990 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 511 transitions. [2024-10-24 00:54:24,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 00:54:24,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:24,992 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] [2024-10-24 00:54:25,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 00:54:25,192 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:54:25,193 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:25,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:25,193 INFO L85 PathProgramCache]: Analyzing trace with hash 297395031, now seen corresponding path program 1 times [2024-10-24 00:54:25,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:25,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56393128] [2024-10-24 00:54:25,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:25,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:25,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:25,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:25,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:25,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:54:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:25,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:54:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:25,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 00:54:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:25,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 00:54:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:25,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:54:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:25,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:54:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:25,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:54:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:25,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:54:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:25,445 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:54:25,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:25,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56393128] [2024-10-24 00:54:25,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56393128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:54:25,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:54:25,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:54:25,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015462104] [2024-10-24 00:54:25,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:54:25,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:54:25,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:25,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:54:25,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:54:25,448 INFO L87 Difference]: Start difference. First operand 323 states and 511 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:54:27,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:27,298 INFO L93 Difference]: Finished difference Result 751 states and 1200 transitions. [2024-10-24 00:54:27,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:54:27,299 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 88 [2024-10-24 00:54:27,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:27,302 INFO L225 Difference]: With dead ends: 751 [2024-10-24 00:54:27,302 INFO L226 Difference]: Without dead ends: 447 [2024-10-24 00:54:27,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:54:27,303 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 885 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2207 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 2465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 2207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:27,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 968 Invalid, 2465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 2207 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 00:54:27,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-10-24 00:54:27,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 323. [2024-10-24 00:54:27,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 251 states have (on average 1.5896414342629481) internal successors, (399), 254 states have internal predecessors, (399), 53 states have call successors, (53), 16 states have call predecessors, (53), 18 states have return successors, (58), 52 states have call predecessors, (58), 52 states have call successors, (58) [2024-10-24 00:54:27,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 510 transitions. [2024-10-24 00:54:27,330 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 510 transitions. Word has length 88 [2024-10-24 00:54:27,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:27,331 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 510 transitions. [2024-10-24 00:54:27,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:54:27,331 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 510 transitions. [2024-10-24 00:54:27,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-24 00:54:27,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:27,333 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] [2024-10-24 00:54:27,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 00:54:27,333 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:27,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:27,334 INFO L85 PathProgramCache]: Analyzing trace with hash 960377390, now seen corresponding path program 2 times [2024-10-24 00:54:27,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:27,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936238672] [2024-10-24 00:54:27,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:27,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:27,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:27,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:27,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:27,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:54:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:27,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:54:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:27,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 00:54:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:27,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 00:54:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:27,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 00:54:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:27,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:54:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:27,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:54:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:27,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:54:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:27,534 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:54:27,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:27,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936238672] [2024-10-24 00:54:27,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936238672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:54:27,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:54:27,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:54:27,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079973314] [2024-10-24 00:54:27,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:54:27,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:54:27,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:27,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:54:27,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:54:27,538 INFO L87 Difference]: Start difference. First operand 323 states and 510 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:54:29,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:29,341 INFO L93 Difference]: Finished difference Result 753 states and 1203 transitions. [2024-10-24 00:54:29,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:54:29,343 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 89 [2024-10-24 00:54:29,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:29,347 INFO L225 Difference]: With dead ends: 753 [2024-10-24 00:54:29,348 INFO L226 Difference]: Without dead ends: 449 [2024-10-24 00:54:29,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:54:29,349 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 881 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 2486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:29,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 968 Invalid, 2486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 2231 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 00:54:29,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-10-24 00:54:29,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 325. [2024-10-24 00:54:29,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 252 states have (on average 1.5873015873015872) internal successors, (400), 256 states have internal predecessors, (400), 53 states have call successors, (53), 16 states have call predecessors, (53), 19 states have return successors, (60), 52 states have call predecessors, (60), 52 states have call successors, (60) [2024-10-24 00:54:29,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 513 transitions. [2024-10-24 00:54:29,377 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 513 transitions. Word has length 89 [2024-10-24 00:54:29,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:29,378 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 513 transitions. [2024-10-24 00:54:29,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-24 00:54:29,378 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 513 transitions. [2024-10-24 00:54:29,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-24 00:54:29,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:29,380 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] [2024-10-24 00:54:29,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 00:54:29,380 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:29,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:29,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1025166894, now seen corresponding path program 1 times [2024-10-24 00:54:29,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:29,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660831995] [2024-10-24 00:54:29,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:29,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:29,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:29,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:29,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:29,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:54:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:29,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:54:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:29,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:54:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:29,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:54:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:29,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 00:54:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:29,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:54:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:29,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:54:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:29,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:54:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:29,608 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:54:29,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:29,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660831995] [2024-10-24 00:54:29,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660831995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:54:29,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:54:29,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:54:29,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455128266] [2024-10-24 00:54:29,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:54:29,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:54:29,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:29,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:54:29,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:54:29,611 INFO L87 Difference]: Start difference. First operand 325 states and 513 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-24 00:54:31,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:31,782 INFO L93 Difference]: Finished difference Result 751 states and 1198 transitions. [2024-10-24 00:54:31,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:54:31,783 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 90 [2024-10-24 00:54:31,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:31,801 INFO L225 Difference]: With dead ends: 751 [2024-10-24 00:54:31,801 INFO L226 Difference]: Without dead ends: 449 [2024-10-24 00:54:31,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-24 00:54:31,805 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 886 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 3640 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 3902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 3640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:31,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 1342 Invalid, 3902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 3640 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 00:54:31,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-10-24 00:54:31,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 325. [2024-10-24 00:54:31,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 252 states have (on average 1.5873015873015872) internal successors, (400), 256 states have internal predecessors, (400), 53 states have call successors, (53), 16 states have call predecessors, (53), 19 states have return successors, (59), 52 states have call predecessors, (59), 52 states have call successors, (59) [2024-10-24 00:54:31,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 512 transitions. [2024-10-24 00:54:31,851 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 512 transitions. Word has length 90 [2024-10-24 00:54:31,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:31,852 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 512 transitions. [2024-10-24 00:54:31,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-24 00:54:31,852 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 512 transitions. [2024-10-24 00:54:31,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 00:54:31,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:31,854 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] [2024-10-24 00:54:31,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 00:54:31,855 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:31,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:31,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1673509057, now seen corresponding path program 2 times [2024-10-24 00:54:31,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:31,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688142053] [2024-10-24 00:54:31,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:31,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:31,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:31,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:31,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:31,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:54:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:32,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:54:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:32,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:54:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:32,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:54:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:32,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 00:54:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:32,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:54:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:32,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:54:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:32,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:54:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:32,090 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:54:32,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:32,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688142053] [2024-10-24 00:54:32,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688142053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:54:32,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:54:32,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:54:32,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071837867] [2024-10-24 00:54:32,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:54:32,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:54:32,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:32,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:54:32,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:54:32,093 INFO L87 Difference]: Start difference. First operand 325 states and 512 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-24 00:54:34,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:34,149 INFO L93 Difference]: Finished difference Result 753 states and 1204 transitions. [2024-10-24 00:54:34,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:54:34,150 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 91 [2024-10-24 00:54:34,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:34,154 INFO L225 Difference]: With dead ends: 753 [2024-10-24 00:54:34,154 INFO L226 Difference]: Without dead ends: 451 [2024-10-24 00:54:34,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 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:54:34,156 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 880 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 3685 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 3943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 3685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:34,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 1342 Invalid, 3943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 3685 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 00:54:34,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-10-24 00:54:34,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 327. [2024-10-24 00:54:34,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 253 states have (on average 1.5849802371541502) internal successors, (401), 258 states have internal predecessors, (401), 53 states have call successors, (53), 16 states have call predecessors, (53), 20 states have return successors, (64), 52 states have call predecessors, (64), 52 states have call successors, (64) [2024-10-24 00:54:34,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 518 transitions. [2024-10-24 00:54:34,190 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 518 transitions. Word has length 91 [2024-10-24 00:54:34,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:34,190 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 518 transitions. [2024-10-24 00:54:34,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-24 00:54:34,191 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 518 transitions. [2024-10-24 00:54:34,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 00:54:34,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:34,192 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] [2024-10-24 00:54:34,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 00:54:34,193 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:34,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:34,193 INFO L85 PathProgramCache]: Analyzing trace with hash -746396851, now seen corresponding path program 1 times [2024-10-24 00:54:34,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:34,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572443557] [2024-10-24 00:54:34,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:34,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:34,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:34,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:34,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:34,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:54:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:34,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:54:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:34,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:54:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:34,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:54:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:34,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 00:54:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:34,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:54:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:34,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:54:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:34,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:54:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:34,404 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:54:34,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:34,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572443557] [2024-10-24 00:54:34,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572443557] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:54:34,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052285839] [2024-10-24 00:54:34,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:34,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:54:34,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:54:34,407 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:54:34,409 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:54:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:34,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:54:34,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:54:34,702 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:54:34,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:54:34,783 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:54:34,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052285839] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:54:34,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:54:34,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-10-24 00:54:34,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300470439] [2024-10-24 00:54:34,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:54:34,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 00:54:34,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:34,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 00:54:34,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:54:34,787 INFO L87 Difference]: Start difference. First operand 327 states and 518 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 7 states have internal predecessors, (81), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 00:54:36,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:36,250 INFO L93 Difference]: Finished difference Result 906 states and 1516 transitions. [2024-10-24 00:54:36,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 00:54:36,250 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 7 states have internal predecessors, (81), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 92 [2024-10-24 00:54:36,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:36,256 INFO L225 Difference]: With dead ends: 906 [2024-10-24 00:54:36,256 INFO L226 Difference]: Without dead ends: 781 [2024-10-24 00:54:36,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:54:36,258 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1419 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:36,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1142 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:54:36,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2024-10-24 00:54:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 642. [2024-10-24 00:54:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 504 states have (on average 1.6388888888888888) internal successors, (826), 509 states have internal predecessors, (826), 117 states have call successors, (117), 16 states have call predecessors, (117), 20 states have return successors, (138), 116 states have call predecessors, (138), 116 states have call successors, (138) [2024-10-24 00:54:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1081 transitions. [2024-10-24 00:54:36,302 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1081 transitions. Word has length 92 [2024-10-24 00:54:36,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:36,303 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 1081 transitions. [2024-10-24 00:54:36,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 7 states have internal predecessors, (81), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-24 00:54:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1081 transitions. [2024-10-24 00:54:36,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 00:54:36,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:36,308 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] [2024-10-24 00:54:36,327 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:54:36,509 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:54:36,509 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:36,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:36,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1078339792, now seen corresponding path program 1 times [2024-10-24 00:54:36,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:36,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637816217] [2024-10-24 00:54:36,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:36,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:36,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:36,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:36,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:36,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:54:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:36,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:54:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:36,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:54:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:36,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:54:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:36,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:54:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:36,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:54:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:36,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:54:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:36,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:54:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:36,613 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:54:36,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:36,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637816217] [2024-10-24 00:54:36,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637816217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:54:36,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:54:36,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:54:36,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503127348] [2024-10-24 00:54:36,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:54:36,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:54:36,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:36,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:54:36,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:54:36,616 INFO L87 Difference]: Start difference. First operand 642 states and 1081 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:37,932 INFO L93 Difference]: Finished difference Result 1665 states and 2865 transitions. [2024-10-24 00:54:37,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:54:37,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-10-24 00:54:37,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:37,940 INFO L225 Difference]: With dead ends: 1665 [2024-10-24 00:54:37,940 INFO L226 Difference]: Without dead ends: 1083 [2024-10-24 00:54:37,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:54:37,943 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 978 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:37,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 739 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 00:54:37,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2024-10-24 00:54:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 954. [2024-10-24 00:54:37,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 752 states have (on average 1.6462765957446808) internal successors, (1238), 757 states have internal predecessors, (1238), 181 states have call successors, (181), 16 states have call predecessors, (181), 20 states have return successors, (212), 180 states have call predecessors, (212), 180 states have call successors, (212) [2024-10-24 00:54:37,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1631 transitions. [2024-10-24 00:54:37,998 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1631 transitions. Word has length 98 [2024-10-24 00:54:37,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:37,999 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1631 transitions. [2024-10-24 00:54:37,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:37,999 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1631 transitions. [2024-10-24 00:54:38,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 00:54:38,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:38,004 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] [2024-10-24 00:54:38,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 00:54:38,005 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:38,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:38,005 INFO L85 PathProgramCache]: Analyzing trace with hash -983733504, now seen corresponding path program 1 times [2024-10-24 00:54:38,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:38,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317742789] [2024-10-24 00:54:38,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:38,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:38,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:38,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:38,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:38,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:54:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:38,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:54:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:38,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:54:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:38,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:54:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:38,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:54:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:38,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:54:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:38,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:54:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:38,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:54:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:38,122 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:54:38,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:38,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317742789] [2024-10-24 00:54:38,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317742789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:54:38,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:54:38,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:54:38,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589191521] [2024-10-24 00:54:38,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:54:38,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:54:38,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:38,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:54:38,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:54:38,124 INFO L87 Difference]: Start difference. First operand 954 states and 1631 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:39,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:39,514 INFO L93 Difference]: Finished difference Result 2414 states and 4183 transitions. [2024-10-24 00:54:39,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:54:39,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2024-10-24 00:54:39,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:39,524 INFO L225 Difference]: With dead ends: 2414 [2024-10-24 00:54:39,525 INFO L226 Difference]: Without dead ends: 1570 [2024-10-24 00:54:39,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:54:39,530 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 976 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:39,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 716 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 00:54:39,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2024-10-24 00:54:39,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1441. [2024-10-24 00:54:39,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1441 states, 1144 states have (on average 1.6503496503496504) internal successors, (1888), 1149 states have internal predecessors, (1888), 276 states have call successors, (276), 16 states have call predecessors, (276), 20 states have return successors, (307), 275 states have call predecessors, (307), 275 states have call successors, (307) [2024-10-24 00:54:39,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 2471 transitions. [2024-10-24 00:54:39,601 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 2471 transitions. Word has length 99 [2024-10-24 00:54:39,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:39,601 INFO L471 AbstractCegarLoop]: Abstraction has 1441 states and 2471 transitions. [2024-10-24 00:54:39,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:39,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 2471 transitions. [2024-10-24 00:54:39,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-24 00:54:39,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:39,608 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] [2024-10-24 00:54:39,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 00:54:39,608 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:39,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:39,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1668408914, now seen corresponding path program 1 times [2024-10-24 00:54:39,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:39,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604878109] [2024-10-24 00:54:39,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:39,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:39,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:39,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:39,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:39,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:54:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:39,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:54:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:39,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:54:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:39,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:54:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:39,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:54:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:39,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:54:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:39,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:54:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:39,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:54:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:39,720 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:54:39,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:39,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604878109] [2024-10-24 00:54:39,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604878109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:54:39,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:54:39,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:54:39,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645392804] [2024-10-24 00:54:39,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:54:39,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:54:39,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:39,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:54:39,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:54:39,722 INFO L87 Difference]: Start difference. First operand 1441 states and 2471 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:41,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:41,052 INFO L93 Difference]: Finished difference Result 3516 states and 6142 transitions. [2024-10-24 00:54:41,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:54:41,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2024-10-24 00:54:41,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:41,066 INFO L225 Difference]: With dead ends: 3516 [2024-10-24 00:54:41,066 INFO L226 Difference]: Without dead ends: 2305 [2024-10-24 00:54:41,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:54:41,074 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 978 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:41,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 706 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 00:54:41,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2024-10-24 00:54:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2176. [2024-10-24 00:54:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 1756 states have (on average 1.6543280182232347) internal successors, (2905), 1761 states have internal predecessors, (2905), 399 states have call successors, (399), 16 states have call predecessors, (399), 20 states have return successors, (446), 398 states have call predecessors, (446), 398 states have call successors, (446) [2024-10-24 00:54:41,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3750 transitions. [2024-10-24 00:54:41,187 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3750 transitions. Word has length 100 [2024-10-24 00:54:41,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:41,188 INFO L471 AbstractCegarLoop]: Abstraction has 2176 states and 3750 transitions. [2024-10-24 00:54:41,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:41,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3750 transitions. [2024-10-24 00:54:41,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 00:54:41,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:41,196 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] [2024-10-24 00:54:41,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 00:54:41,196 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:41,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:41,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1562424447, now seen corresponding path program 1 times [2024-10-24 00:54:41,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:41,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746703807] [2024-10-24 00:54:41,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:41,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:41,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:41,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:41,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:41,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:54:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:41,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:54:41,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:41,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:54:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:41,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:54:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:41,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:54:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:41,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:54:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:41,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:54:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:41,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:54:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:41,341 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:54:41,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:41,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746703807] [2024-10-24 00:54:41,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746703807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:54:41,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:54:41,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:54:41,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954834996] [2024-10-24 00:54:41,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:54:41,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:54:41,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:41,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:54:41,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:54:41,344 INFO L87 Difference]: Start difference. First operand 2176 states and 3750 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:42,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:42,826 INFO L93 Difference]: Finished difference Result 5226 states and 9192 transitions. [2024-10-24 00:54:42,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:54:42,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2024-10-24 00:54:42,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:42,874 INFO L225 Difference]: With dead ends: 5226 [2024-10-24 00:54:42,874 INFO L226 Difference]: Without dead ends: 3477 [2024-10-24 00:54:42,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:54:42,882 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 972 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:42,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 707 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 00:54:42,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3477 states. [2024-10-24 00:54:43,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3477 to 3348. [2024-10-24 00:54:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3348 states, 2749 states have (on average 1.6569661695161877) internal successors, (4555), 2754 states have internal predecessors, (4555), 578 states have call successors, (578), 16 states have call predecessors, (578), 20 states have return successors, (651), 577 states have call predecessors, (651), 577 states have call successors, (651) [2024-10-24 00:54:43,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3348 states to 3348 states and 5784 transitions. [2024-10-24 00:54:43,091 INFO L78 Accepts]: Start accepts. Automaton has 3348 states and 5784 transitions. Word has length 101 [2024-10-24 00:54:43,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:43,092 INFO L471 AbstractCegarLoop]: Abstraction has 3348 states and 5784 transitions. [2024-10-24 00:54:43,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:43,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3348 states and 5784 transitions. [2024-10-24 00:54:43,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-24 00:54:43,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:43,101 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] [2024-10-24 00:54:43,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 00:54:43,101 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:43,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:43,101 INFO L85 PathProgramCache]: Analyzing trace with hash -595338702, now seen corresponding path program 1 times [2024-10-24 00:54:43,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:43,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325600573] [2024-10-24 00:54:43,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:43,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:43,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:43,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:43,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:43,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:54:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:43,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:54:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:43,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:54:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:43,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:54:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:43,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:54:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:43,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:54:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:43,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:54:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:43,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:54:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:43,200 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:54:43,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:43,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325600573] [2024-10-24 00:54:43,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325600573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:54:43,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:54:43,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:54:43,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469613532] [2024-10-24 00:54:43,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:54:43,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:54:43,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:43,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:54:43,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:54:43,203 INFO L87 Difference]: Start difference. First operand 3348 states and 5784 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:44,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:44,467 INFO L93 Difference]: Finished difference Result 8081 states and 14246 transitions. [2024-10-24 00:54:44,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:54:44,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2024-10-24 00:54:44,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:44,501 INFO L225 Difference]: With dead ends: 8081 [2024-10-24 00:54:44,501 INFO L226 Difference]: Without dead ends: 5447 [2024-10-24 00:54:44,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:54:44,513 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 969 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:44,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 749 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:54:44,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5447 states. [2024-10-24 00:54:44,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5447 to 5318. [2024-10-24 00:54:44,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5318 states, 4343 states have (on average 1.6454064011052267) internal successors, (7146), 4348 states have internal predecessors, (7146), 954 states have call successors, (954), 16 states have call predecessors, (954), 20 states have return successors, (1071), 953 states have call predecessors, (1071), 953 states have call successors, (1071) [2024-10-24 00:54:44,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5318 states to 5318 states and 9171 transitions. [2024-10-24 00:54:44,809 INFO L78 Accepts]: Start accepts. Automaton has 5318 states and 9171 transitions. Word has length 102 [2024-10-24 00:54:44,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:44,810 INFO L471 AbstractCegarLoop]: Abstraction has 5318 states and 9171 transitions. [2024-10-24 00:54:44,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 5318 states and 9171 transitions. [2024-10-24 00:54:44,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 00:54:44,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:44,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] [2024-10-24 00:54:44,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 00:54:44,822 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:44,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:44,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2089461755, now seen corresponding path program 1 times [2024-10-24 00:54:44,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:44,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865195245] [2024-10-24 00:54:44,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:44,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:44,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:44,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:44,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:44,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:54:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:44,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:54:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:44,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:54:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:44,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:54:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:44,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:54:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:44,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:54:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:44,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:54:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:44,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:54:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:44,925 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:54:44,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:44,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865195245] [2024-10-24 00:54:44,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865195245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:54:44,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:54:44,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:54:44,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137492239] [2024-10-24 00:54:44,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:54:44,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:54:44,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:44,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:54:44,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:54:44,927 INFO L87 Difference]: Start difference. First operand 5318 states and 9171 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:46,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:46,152 INFO L93 Difference]: Finished difference Result 13218 states and 23267 transitions. [2024-10-24 00:54:46,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:54:46,152 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-10-24 00:54:46,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:46,213 INFO L225 Difference]: With dead ends: 13218 [2024-10-24 00:54:46,213 INFO L226 Difference]: Without dead ends: 8980 [2024-10-24 00:54:46,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:54:46,233 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 971 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:46,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 723 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:54:46,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8980 states. [2024-10-24 00:54:46,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8980 to 8851. [2024-10-24 00:54:46,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8851 states, 7270 states have (on average 1.6426409903713892) internal successors, (11942), 7275 states have internal predecessors, (11942), 1560 states have call successors, (1560), 16 states have call predecessors, (1560), 20 states have return successors, (1755), 1559 states have call predecessors, (1755), 1559 states have call successors, (1755) [2024-10-24 00:54:46,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8851 states to 8851 states and 15257 transitions. [2024-10-24 00:54:46,760 INFO L78 Accepts]: Start accepts. Automaton has 8851 states and 15257 transitions. Word has length 103 [2024-10-24 00:54:46,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:46,761 INFO L471 AbstractCegarLoop]: Abstraction has 8851 states and 15257 transitions. [2024-10-24 00:54:46,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 8851 states and 15257 transitions. [2024-10-24 00:54:46,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 00:54:46,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:46,777 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] [2024-10-24 00:54:46,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 00:54:46,777 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:46,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:46,777 INFO L85 PathProgramCache]: Analyzing trace with hash -115582396, now seen corresponding path program 1 times [2024-10-24 00:54:46,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:46,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893125762] [2024-10-24 00:54:46,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:46,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:46,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:46,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:46,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:46,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:54:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:46,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:54:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:46,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:54:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:46,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:54:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:46,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:54:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:46,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:54:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:46,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:54:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:46,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:54:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:46,880 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:54:46,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:46,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893125762] [2024-10-24 00:54:46,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893125762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:54:46,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:54:46,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:54:46,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144167301] [2024-10-24 00:54:46,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:54:46,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:54:46,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:46,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:54:46,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:54:46,884 INFO L87 Difference]: Start difference. First operand 8851 states and 15257 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:48,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:48,283 INFO L93 Difference]: Finished difference Result 22990 states and 40401 transitions. [2024-10-24 00:54:48,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:54:48,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-10-24 00:54:48,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:48,358 INFO L225 Difference]: With dead ends: 22990 [2024-10-24 00:54:48,358 INFO L226 Difference]: Without dead ends: 15652 [2024-10-24 00:54:48,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:54:48,382 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 970 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 1594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:48,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 740 Invalid, 1594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:54:48,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15652 states. [2024-10-24 00:54:48,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15652 to 15523. [2024-10-24 00:54:48,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15523 states, 12739 states have (on average 1.6330167203077164) internal successors, (20803), 12744 states have internal predecessors, (20803), 2763 states have call successors, (2763), 16 states have call predecessors, (2763), 20 states have return successors, (3102), 2762 states have call predecessors, (3102), 2762 states have call successors, (3102) [2024-10-24 00:54:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15523 states to 15523 states and 26668 transitions. [2024-10-24 00:54:49,037 INFO L78 Accepts]: Start accepts. Automaton has 15523 states and 26668 transitions. Word has length 104 [2024-10-24 00:54:49,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:49,038 INFO L471 AbstractCegarLoop]: Abstraction has 15523 states and 26668 transitions. [2024-10-24 00:54:49,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 15523 states and 26668 transitions. [2024-10-24 00:54:49,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 00:54:49,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:49,060 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] [2024-10-24 00:54:49,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 00:54:49,060 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:49,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:49,061 INFO L85 PathProgramCache]: Analyzing trace with hash -125559718, now seen corresponding path program 1 times [2024-10-24 00:54:49,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:49,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989436254] [2024-10-24 00:54:49,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:49,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:49,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:49,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:49,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:49,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:54:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:49,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:54:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:49,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:54:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:49,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:54:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:49,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:54:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:49,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:54:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:49,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:54:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:49,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:54:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:49,178 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:54:49,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:49,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989436254] [2024-10-24 00:54:49,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989436254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:54:49,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:54:49,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:54:49,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976356398] [2024-10-24 00:54:49,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:54:49,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:54:49,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:49,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:54:49,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:54:49,182 INFO L87 Difference]: Start difference. First operand 15523 states and 26668 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:50,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:50,989 INFO L93 Difference]: Finished difference Result 41157 states and 72201 transitions. [2024-10-24 00:54:50,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:54:50,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2024-10-24 00:54:50,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:51,111 INFO L225 Difference]: With dead ends: 41157 [2024-10-24 00:54:51,112 INFO L226 Difference]: Without dead ends: 27767 [2024-10-24 00:54:51,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:54:51,158 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 966 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:51,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 709 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 00:54:51,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27767 states. [2024-10-24 00:54:52,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27767 to 27638. [2024-10-24 00:54:52,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27638 states, 22815 states have (on average 1.629059829059829) internal successors, (37167), 22820 states have internal predecessors, (37167), 4802 states have call successors, (4802), 16 states have call predecessors, (4802), 20 states have return successors, (5415), 4801 states have call predecessors, (5415), 4801 states have call successors, (5415) [2024-10-24 00:54:52,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27638 states to 27638 states and 47384 transitions. [2024-10-24 00:54:52,334 INFO L78 Accepts]: Start accepts. Automaton has 27638 states and 47384 transitions. Word has length 105 [2024-10-24 00:54:52,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:52,335 INFO L471 AbstractCegarLoop]: Abstraction has 27638 states and 47384 transitions. [2024-10-24 00:54:52,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:52,335 INFO L276 IsEmpty]: Start isEmpty. Operand 27638 states and 47384 transitions. [2024-10-24 00:54:52,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 00:54:52,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:52,365 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] [2024-10-24 00:54:52,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 00:54:52,365 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:52,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:52,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1607288418, now seen corresponding path program 1 times [2024-10-24 00:54:52,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:52,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267707558] [2024-10-24 00:54:52,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:52,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:52,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:52,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:52,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:52,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:54:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:52,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:54:52,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:52,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:54:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:52,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:54:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:52,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:54:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:52,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:54:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:52,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:54:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:52,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:54:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:52,693 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:54:52,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:52,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267707558] [2024-10-24 00:54:52,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267707558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:54:52,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:54:52,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:54:52,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523288904] [2024-10-24 00:54:52,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:54:52,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:54:52,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:52,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:54:52,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:54:52,696 INFO L87 Difference]: Start difference. First operand 27638 states and 47384 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:55,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:54:55,271 INFO L93 Difference]: Finished difference Result 75349 states and 131390 transitions. [2024-10-24 00:54:55,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:54:55,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2024-10-24 00:54:55,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:54:55,523 INFO L225 Difference]: With dead ends: 75349 [2024-10-24 00:54:55,524 INFO L226 Difference]: Without dead ends: 50591 [2024-10-24 00:54:55,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:54:55,607 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 962 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:54:55,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 727 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:54:55,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50591 states. [2024-10-24 00:54:57,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50591 to 50462. [2024-10-24 00:54:57,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50462 states, 41924 states have (on average 1.6239147027955347) internal successors, (68081), 41929 states have internal predecessors, (68081), 8517 states have call successors, (8517), 16 states have call predecessors, (8517), 20 states have return successors, (9662), 8516 states have call predecessors, (9662), 8516 states have call successors, (9662) [2024-10-24 00:54:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50462 states to 50462 states and 86260 transitions. [2024-10-24 00:54:58,180 INFO L78 Accepts]: Start accepts. Automaton has 50462 states and 86260 transitions. Word has length 106 [2024-10-24 00:54:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:54:58,182 INFO L471 AbstractCegarLoop]: Abstraction has 50462 states and 86260 transitions. [2024-10-24 00:54:58,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:54:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 50462 states and 86260 transitions. [2024-10-24 00:54:58,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 00:54:58,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:54:58,209 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] [2024-10-24 00:54:58,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 00:54:58,210 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:54:58,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:54:58,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1384127750, now seen corresponding path program 1 times [2024-10-24 00:54:58,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:54:58,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087880139] [2024-10-24 00:54:58,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:54:58,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:54:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:58,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:54:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:58,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:54:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:58,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:54:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:58,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:54:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:58,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:54:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:58,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:54:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:58,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:54:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:58,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:54:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:58,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:54:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:58,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:54:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:58,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:54:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:54:58,328 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:54:58,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:54:58,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087880139] [2024-10-24 00:54:58,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087880139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:54:58,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:54:58,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:54:58,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939427406] [2024-10-24 00:54:58,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:54:58,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:54:58,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:54:58,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:54:58,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:54:58,330 INFO L87 Difference]: Start difference. First operand 50462 states and 86260 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:55:01,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:55:01,492 INFO L93 Difference]: Finished difference Result 94096 states and 164553 transitions. [2024-10-24 00:55:01,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:55:01,493 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2024-10-24 00:55:01,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:55:02,085 INFO L225 Difference]: With dead ends: 94096 [2024-10-24 00:55:02,086 INFO L226 Difference]: Without dead ends: 93971 [2024-10-24 00:55:02,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:55:02,135 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 961 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:55:02,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 720 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 1273 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:55:02,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93971 states. [2024-10-24 00:55:04,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93971 to 93842. [2024-10-24 00:55:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93842 states, 78505 states have (on average 1.6173746895102223) internal successors, (126972), 78510 states have internal predecessors, (126972), 15316 states have call successors, (15316), 16 states have call predecessors, (15316), 20 states have return successors, (17507), 15315 states have call predecessors, (17507), 15315 states have call successors, (17507) [2024-10-24 00:55:05,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93842 states to 93842 states and 159795 transitions. [2024-10-24 00:55:05,765 INFO L78 Accepts]: Start accepts. Automaton has 93842 states and 159795 transitions. Word has length 107 [2024-10-24 00:55:05,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:55:05,766 INFO L471 AbstractCegarLoop]: Abstraction has 93842 states and 159795 transitions. [2024-10-24 00:55:05,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 00:55:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 93842 states and 159795 transitions. [2024-10-24 00:55:05,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 00:55:05,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:55:05,788 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] [2024-10-24 00:55:05,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 00:55:05,788 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:55:05,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:55:05,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2111082115, now seen corresponding path program 1 times [2024-10-24 00:55:05,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:55:05,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570444113] [2024-10-24 00:55:05,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:55:05,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:55:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:55:05,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:55:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:55:05,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:55:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:55:05,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:55:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:55:05,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:55:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:55:05,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:55:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:55:05,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:55:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:55:05,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:55:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:55:05,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:55:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:55:05,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:55:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:55:05,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:55:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:55:05,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:55:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:55:05,967 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:55:05,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:55:05,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570444113] [2024-10-24 00:55:05,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570444113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:55:05,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:55:05,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:55:05,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281841755] [2024-10-24 00:55:05,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:55:05,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:55:05,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:55:05,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:55:05,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:55:05,970 INFO L87 Difference]: Start difference. First operand 93842 states and 159795 transitions. Second operand has 9 states, 8 states have (on average 8.875) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 00:55:09,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:55:09,708 INFO L93 Difference]: Finished difference Result 93964 states and 163270 transitions. [2024-10-24 00:55:09,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 00:55:09,709 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2024-10-24 00:55:09,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:55:09,736 INFO L225 Difference]: With dead ends: 93964 [2024-10-24 00:55:09,736 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 00:55:09,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2024-10-24 00:55:09,891 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 869 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 2220 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 2463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 2220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:55:09,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 977 Invalid, 2463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 2220 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:55:09,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 00:55:09,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 00:55:09,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 00:55:09,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 00:55:09,916 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2024-10-24 00:55:09,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:55:09,917 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 00:55:09,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.875) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 00:55:09,917 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 00:55:09,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 00:55:09,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 00:55:09,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 00:55:09,922 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:55:09,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.