./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_spec4_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_spec4_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 f3a1dbda837d8ce3c466139238aee66f09284cf7efb22d92a7aae56a5f98c665 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 00:50:42,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 00:50:42,203 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 00:50:42,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 00:50:42,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 00:50:42,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 00:50:42,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 00:50:42,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 00:50:42,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 00:50:42,243 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 00:50:42,244 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 00:50:42,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 00:50:42,245 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 00:50:42,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 00:50:42,245 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 00:50:42,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 00:50:42,248 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 00:50:42,249 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 00:50:42,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 00:50:42,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 00:50:42,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 00:50:42,250 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 00:50:42,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 00:50:42,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 00:50:42,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 00:50:42,255 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 00:50:42,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 00:50:42,255 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 00:50:42,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 00:50:42,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 00:50:42,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 00:50:42,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 00:50:42,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:50:42,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 00:50:42,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 00:50:42,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 00:50:42,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 00:50:42,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 00:50:42,259 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 00:50:42,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 00:50:42,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 00:50:42,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 00:50:42,260 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 -> f3a1dbda837d8ce3c466139238aee66f09284cf7efb22d92a7aae56a5f98c665 [2024-10-24 00:50:42,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 00:50:42,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 00:50:42,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 00:50:42,523 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 00:50:42,523 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 00:50:42,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product19.cil.c [2024-10-24 00:50:43,920 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 00:50:44,223 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 00:50:44,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product19.cil.c [2024-10-24 00:50:44,252 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8259c0fd/7a0c689a3739409c818dea3026ce1840/FLAG8d0c030d3 [2024-10-24 00:50:44,266 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8259c0fd/7a0c689a3739409c818dea3026ce1840 [2024-10-24 00:50:44,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 00:50:44,271 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 00:50:44,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 00:50:44,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 00:50:44,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 00:50:44,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:50:44" (1/1) ... [2024-10-24 00:50:44,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43d1a092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:50:44, skipping insertion in model container [2024-10-24 00:50:44,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:50:44" (1/1) ... [2024-10-24 00:50:44,336 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 00:50:44,535 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_spec4_product19.cil.c[1542,1555] [2024-10-24 00:50:44,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:50:44,933 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 00:50:44,944 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2024-10-24 00:50:44,946 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [57] [2024-10-24 00:50:44,946 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [98] [2024-10-24 00:50:44,946 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [136] [2024-10-24 00:50:44,947 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [502] [2024-10-24 00:50:44,947 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [802] [2024-10-24 00:50:44,947 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1018] [2024-10-24 00:50:44,947 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1319] [2024-10-24 00:50:44,948 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1336] [2024-10-24 00:50:44,948 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1434] [2024-10-24 00:50:44,949 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2501] [2024-10-24 00:50:44,952 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_spec4_product19.cil.c[1542,1555] [2024-10-24 00:50:45,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:50:45,081 INFO L204 MainTranslator]: Completed translation [2024-10-24 00:50:45,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:50:45 WrapperNode [2024-10-24 00:50:45,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 00:50:45,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 00:50:45,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 00:50:45,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 00:50:45,091 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:50:45" (1/1) ... [2024-10-24 00:50:45,119 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:50:45" (1/1) ... [2024-10-24 00:50:45,172 INFO L138 Inliner]: procedures = 127, calls = 185, calls flagged for inlining = 59, calls inlined = 54, statements flattened = 992 [2024-10-24 00:50:45,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 00:50:45,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 00:50:45,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 00:50:45,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 00:50:45,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:50:45" (1/1) ... [2024-10-24 00:50:45,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:50:45" (1/1) ... [2024-10-24 00:50:45,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:50:45" (1/1) ... [2024-10-24 00:50:45,227 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:50:45,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:50:45" (1/1) ... [2024-10-24 00:50:45,228 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:50:45" (1/1) ... [2024-10-24 00:50:45,246 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:50:45" (1/1) ... [2024-10-24 00:50:45,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:50:45" (1/1) ... [2024-10-24 00:50:45,264 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:50:45" (1/1) ... [2024-10-24 00:50:45,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:50:45" (1/1) ... [2024-10-24 00:50:45,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 00:50:45,277 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 00:50:45,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 00:50:45,278 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 00:50:45,279 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:50:45" (1/1) ... [2024-10-24 00:50:45,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:50:45,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:50:45,334 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:50:45,337 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:50:45,387 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-10-24 00:50:45,388 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-10-24 00:50:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-24 00:50:45,388 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-24 00:50:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-24 00:50:45,388 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-24 00:50:45,388 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-24 00:50:45,390 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-24 00:50:45,390 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-24 00:50:45,390 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-24 00:50:45,391 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-24 00:50:45,391 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-24 00:50:45,391 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-24 00:50:45,391 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-24 00:50:45,391 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-24 00:50:45,391 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-24 00:50:45,391 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-24 00:50:45,391 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-24 00:50:45,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 00:50:45,392 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-24 00:50:45,392 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-24 00:50:45,392 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-24 00:50:45,392 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-24 00:50:45,392 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-24 00:50:45,392 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-24 00:50:45,392 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-24 00:50:45,392 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-24 00:50:45,393 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-24 00:50:45,393 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-24 00:50:45,393 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-24 00:50:45,393 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-24 00:50:45,393 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-24 00:50:45,393 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-24 00:50:45,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 00:50:45,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 00:50:45,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 00:50:45,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 00:50:45,395 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-24 00:50:45,396 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-24 00:50:45,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 00:50:45,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 00:50:45,603 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 00:50:45,605 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 00:50:46,572 INFO L? ?]: Removed 434 outVars from TransFormulas that were not future-live. [2024-10-24 00:50:46,572 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 00:50:46,631 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 00:50:46,632 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 00:50:46,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:50:46 BoogieIcfgContainer [2024-10-24 00:50:46,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 00:50:46,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 00:50:46,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 00:50:46,637 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 00:50:46,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:50:44" (1/3) ... [2024-10-24 00:50:46,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5da0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:50:46, skipping insertion in model container [2024-10-24 00:50:46,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:50:45" (2/3) ... [2024-10-24 00:50:46,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5da0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:50:46, skipping insertion in model container [2024-10-24 00:50:46,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:50:46" (3/3) ... [2024-10-24 00:50:46,640 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec4_product19.cil.c [2024-10-24 00:50:46,656 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 00:50:46,657 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 00:50:46,741 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 00:50:46,747 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;@4ebed601, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 00:50:46,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 00:50:46,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 280 states, 217 states have (on average 1.599078341013825) internal successors, (347), 219 states have internal predecessors, (347), 44 states have call successors, (44), 17 states have call predecessors, (44), 17 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 00:50:46,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 00:50:46,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:46,772 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:50:46,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:46,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:46,778 INFO L85 PathProgramCache]: Analyzing trace with hash -613452107, now seen corresponding path program 1 times [2024-10-24 00:50:46,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:46,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784908381] [2024-10-24 00:50:46,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:46,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:47,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:47,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:47,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:47,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:50:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:47,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:50:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:47,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:50:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:47,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 00:50:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:47,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 00:50:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:47,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:50:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:47,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:50:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:47,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:50:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:47,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:50:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-24 00:50:47,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:47,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784908381] [2024-10-24 00:50:47,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784908381] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:50:47,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926442066] [2024-10-24 00:50:47,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:47,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:50:47,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:50:47,572 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:50:47,573 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:50:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:47,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 00:50:47,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:50:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-24 00:50:47,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:50:47,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926442066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:47,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:50:47,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-24 00:50:47,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862444951] [2024-10-24 00:50:47,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:47,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 00:50:47,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:47,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 00:50:47,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:50:47,986 INFO L87 Difference]: Start difference. First operand has 280 states, 217 states have (on average 1.599078341013825) internal successors, (347), 219 states have internal predecessors, (347), 44 states have call successors, (44), 17 states have call predecessors, (44), 17 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:50:48,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:48,069 INFO L93 Difference]: Finished difference Result 415 states and 633 transitions. [2024-10-24 00:50:48,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 00:50:48,072 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 86 [2024-10-24 00:50:48,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:48,083 INFO L225 Difference]: With dead ends: 415 [2024-10-24 00:50:48,083 INFO L226 Difference]: Without dead ends: 277 [2024-10-24 00:50:48,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 106 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:50:48,092 INFO L432 NwaCegarLoop]: 416 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, 416 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:50:48,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 416 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:50:48,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-24 00:50:48,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2024-10-24 00:50:48,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 215 states have (on average 1.5813953488372092) internal successors, (340), 216 states have internal predecessors, (340), 44 states have call successors, (44), 17 states have call predecessors, (44), 17 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-24 00:50:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 427 transitions. [2024-10-24 00:50:48,156 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 427 transitions. Word has length 86 [2024-10-24 00:50:48,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:48,158 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 427 transitions. [2024-10-24 00:50:48,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:50:48,158 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 427 transitions. [2024-10-24 00:50:48,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 00:50:48,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:48,164 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:50:48,178 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:50:48,364 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:50:48,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:48,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:48,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1059923735, now seen corresponding path program 1 times [2024-10-24 00:50:48,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:48,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301646213] [2024-10-24 00:50:48,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:48,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:48,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:48,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:48,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:48,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:50:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:48,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:50:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:48,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:50:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:48,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:50:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:48,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 00:50:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:48,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:50:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:48,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:50:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:48,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:50:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:48,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:50:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-24 00:50:48,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:48,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301646213] [2024-10-24 00:50:48,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301646213] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:50:48,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114012136] [2024-10-24 00:50:48,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:48,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:50:48,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:50:48,672 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:50:48,674 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:50:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:48,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 00:50:48,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:50:48,999 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-24 00:50:48,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:50:49,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114012136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:49,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:50:49,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 00:50:49,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662349706] [2024-10-24 00:50:49,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:49,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:50:49,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:49,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:50:49,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:50:49,006 INFO L87 Difference]: Start difference. First operand 277 states and 427 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:50:49,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:49,082 INFO L93 Difference]: Finished difference Result 411 states and 620 transitions. [2024-10-24 00:50:49,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:50:49,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 87 [2024-10-24 00:50:49,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:49,089 INFO L225 Difference]: With dead ends: 411 [2024-10-24 00:50:49,089 INFO L226 Difference]: Without dead ends: 279 [2024-10-24 00:50:49,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 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:50:49,092 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 0 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 825 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:50:49,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 825 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:50:49,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-10-24 00:50:49,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2024-10-24 00:50:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 217 states have (on average 1.576036866359447) internal successors, (342), 218 states have internal predecessors, (342), 44 states have call successors, (44), 17 states have call predecessors, (44), 17 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-24 00:50:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 429 transitions. [2024-10-24 00:50:49,130 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 429 transitions. Word has length 87 [2024-10-24 00:50:49,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:49,131 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 429 transitions. [2024-10-24 00:50:49,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:50:49,132 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 429 transitions. [2024-10-24 00:50:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 00:50:49,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:49,137 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-24 00:50:49,158 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:50:49,337 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:50:49,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:49,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:49,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1361005970, now seen corresponding path program 1 times [2024-10-24 00:50:49,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:49,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636375676] [2024-10-24 00:50:49,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:49,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:49,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:49,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:49,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:49,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:49,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:50:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:49,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:50:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:49,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:50:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:49,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 00:50:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:49,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:50:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:49,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:50:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:49,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:50:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:49,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:50:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:49,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:50:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:50:49,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:49,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636375676] [2024-10-24 00:50:49,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636375676] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:50:49,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93379646] [2024-10-24 00:50:49,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:49,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:50:49,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:50:49,641 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:50:49,643 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:50:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:49,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 923 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:50:49,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:50:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-24 00:50:49,966 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:50:49,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93379646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:49,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:50:49,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 00:50:49,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863736963] [2024-10-24 00:50:49,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:49,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:50:49,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:49,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:50:49,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:50:49,971 INFO L87 Difference]: Start difference. First operand 279 states and 429 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:50:50,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:50,055 INFO L93 Difference]: Finished difference Result 588 states and 917 transitions. [2024-10-24 00:50:50,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:50:50,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 92 [2024-10-24 00:50:50,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:50,060 INFO L225 Difference]: With dead ends: 588 [2024-10-24 00:50:50,060 INFO L226 Difference]: Without dead ends: 331 [2024-10-24 00:50:50,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 111 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:50:50,065 INFO L432 NwaCegarLoop]: 430 mSDtfsCounter, 102 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 801 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:50:50,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 801 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:50:50,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-24 00:50:50,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 326. [2024-10-24 00:50:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 253 states have (on average 1.5889328063241106) internal successors, (402), 254 states have internal predecessors, (402), 55 states have call successors, (55), 17 states have call predecessors, (55), 17 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-24 00:50:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 511 transitions. [2024-10-24 00:50:50,099 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 511 transitions. Word has length 92 [2024-10-24 00:50:50,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:50,100 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 511 transitions. [2024-10-24 00:50:50,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:50:50,100 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 511 transitions. [2024-10-24 00:50:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 00:50:50,103 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:50,103 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-24 00:50:50,123 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:50:50,303 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:50:50,304 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:50,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:50,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1167109828, now seen corresponding path program 1 times [2024-10-24 00:50:50,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:50,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865858926] [2024-10-24 00:50:50,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:50,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:50,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:50,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:50,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:50,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:50:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:50,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:50:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:50,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:50:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:50,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 00:50:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:50,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:50:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:50,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:50:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:50,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:50:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:50,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:50:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:50,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:50:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:50:50,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:50,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865858926] [2024-10-24 00:50:50,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865858926] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:50:50,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028149951] [2024-10-24 00:50:50,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:50,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:50:50,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:50:50,500 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:50:50,501 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:50:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:50,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 00:50:50,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:50:50,870 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 00:50:50,870 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:50:50,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028149951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:50,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:50:50,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-24 00:50:50,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472443537] [2024-10-24 00:50:50,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:50,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:50:50,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:50,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:50:50,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:50:50,872 INFO L87 Difference]: Start difference. First operand 326 states and 511 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 00:50:50,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:50,976 INFO L93 Difference]: Finished difference Result 647 states and 1016 transitions. [2024-10-24 00:50:50,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:50:50,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 93 [2024-10-24 00:50:50,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:50,980 INFO L225 Difference]: With dead ends: 647 [2024-10-24 00:50:50,982 INFO L226 Difference]: Without dead ends: 328 [2024-10-24 00:50:50,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 110 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:50:50,985 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 2 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1609 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:50:50,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1609 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:50:50,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-10-24 00:50:51,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2024-10-24 00:50:51,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 254 states have (on average 1.5866141732283465) internal successors, (403), 256 states have internal predecessors, (403), 55 states have call successors, (55), 17 states have call predecessors, (55), 18 states have return successors, (56), 54 states have call predecessors, (56), 54 states have call successors, (56) [2024-10-24 00:50:51,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 514 transitions. [2024-10-24 00:50:51,004 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 514 transitions. Word has length 93 [2024-10-24 00:50:51,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:51,004 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 514 transitions. [2024-10-24 00:50:51,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 00:50:51,005 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 514 transitions. [2024-10-24 00:50:51,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 00:50:51,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:51,007 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:50:51,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 00:50:51,207 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:50:51,207 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:51,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:51,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1571684138, now seen corresponding path program 1 times [2024-10-24 00:50:51,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:51,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032918658] [2024-10-24 00:50:51,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:51,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:51,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:51,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:51,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:51,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:51,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 00:50:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:51,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 00:50:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:51,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 00:50:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:51,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:50:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:51,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:50:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:51,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:50:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:51,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:50:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:51,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:50:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:51,432 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:50:51,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:51,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032918658] [2024-10-24 00:50:51,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032918658] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:50:51,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630337815] [2024-10-24 00:50:51,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:51,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:50:51,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:50:51,434 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:50:51,435 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:50:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:51,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 00:50:51,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:50:51,759 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 00:50:51,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:50:51,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630337815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:51,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:50:51,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-24 00:50:51,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392227873] [2024-10-24 00:50:51,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:51,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:50:51,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:51,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:50:51,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:50:51,761 INFO L87 Difference]: Start difference. First operand 328 states and 514 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 00:50:51,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:51,853 INFO L93 Difference]: Finished difference Result 649 states and 1021 transitions. [2024-10-24 00:50:51,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:50:51,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 94 [2024-10-24 00:50:51,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:51,856 INFO L225 Difference]: With dead ends: 649 [2024-10-24 00:50:51,856 INFO L226 Difference]: Without dead ends: 330 [2024-10-24 00:50:51,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 110 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:50:51,858 INFO L432 NwaCegarLoop]: 403 mSDtfsCounter, 2 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1595 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:50:51,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1595 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:50:51,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-10-24 00:50:51,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2024-10-24 00:50:51,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 255 states have (on average 1.584313725490196) internal successors, (404), 258 states have internal predecessors, (404), 55 states have call successors, (55), 17 states have call predecessors, (55), 19 states have return successors, (61), 54 states have call predecessors, (61), 54 states have call successors, (61) [2024-10-24 00:50:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 520 transitions. [2024-10-24 00:50:51,873 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 520 transitions. Word has length 94 [2024-10-24 00:50:51,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:51,873 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 520 transitions. [2024-10-24 00:50:51,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 00:50:51,873 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 520 transitions. [2024-10-24 00:50:51,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 00:50:51,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:51,875 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:50:51,896 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:50:52,075 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:50:52,076 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:52,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:52,077 INFO L85 PathProgramCache]: Analyzing trace with hash 952909046, now seen corresponding path program 1 times [2024-10-24 00:50:52,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:52,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113128229] [2024-10-24 00:50:52,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:52,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:52,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:52,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:52,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:52,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:52,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:50:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:52,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 00:50:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:52,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 00:50:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:52,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:50:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:52,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:50:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:52,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:50:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:52,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:50:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:52,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:50:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:50:52,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:52,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113128229] [2024-10-24 00:50:52,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113128229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:52,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:50:52,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:50:52,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226468160] [2024-10-24 00:50:52,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:52,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:50:52,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:52,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:50:52,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:50:52,301 INFO L87 Difference]: Start difference. First operand 330 states and 520 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 00:50:54,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:54,197 INFO L93 Difference]: Finished difference Result 768 states and 1223 transitions. [2024-10-24 00:50:54,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:50:54,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 95 [2024-10-24 00:50:54,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:54,201 INFO L225 Difference]: With dead ends: 768 [2024-10-24 00:50:54,201 INFO L226 Difference]: Without dead ends: 457 [2024-10-24 00:50:54,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 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:50:54,203 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 902 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 2573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:50:54,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 968 Invalid, 2573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 2310 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 00:50:54,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-10-24 00:50:54,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 330. [2024-10-24 00:50:54,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 255 states have (on average 1.584313725490196) internal successors, (404), 258 states have internal predecessors, (404), 55 states have call successors, (55), 17 states have call predecessors, (55), 19 states have return successors, (60), 54 states have call predecessors, (60), 54 states have call successors, (60) [2024-10-24 00:50:54,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 519 transitions. [2024-10-24 00:50:54,242 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 519 transitions. Word has length 95 [2024-10-24 00:50:54,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:54,242 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 519 transitions. [2024-10-24 00:50:54,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 00:50:54,242 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 519 transitions. [2024-10-24 00:50:54,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 00:50:54,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:54,244 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:50:54,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 00:50:54,245 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:54,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:54,245 INFO L85 PathProgramCache]: Analyzing trace with hash -126792402, now seen corresponding path program 2 times [2024-10-24 00:50:54,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:54,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529903635] [2024-10-24 00:50:54,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:54,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:54,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:54,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:54,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:54,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:54,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:50:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:54,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 00:50:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:54,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 00:50:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:54,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 00:50:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:54,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:50:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:54,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:50:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:54,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:50:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:54,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:50:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:54,457 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:50:54,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:54,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529903635] [2024-10-24 00:50:54,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529903635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:54,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:50:54,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:50:54,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673487732] [2024-10-24 00:50:54,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:54,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:50:54,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:54,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:50:54,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:50:54,459 INFO L87 Difference]: Start difference. First operand 330 states and 519 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 00:50:56,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:56,328 INFO L93 Difference]: Finished difference Result 770 states and 1226 transitions. [2024-10-24 00:50:56,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:50:56,329 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 96 [2024-10-24 00:50:56,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:56,334 INFO L225 Difference]: With dead ends: 770 [2024-10-24 00:50:56,334 INFO L226 Difference]: Without dead ends: 459 [2024-10-24 00:50:56,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 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:50:56,335 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 899 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 2567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:50:56,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 967 Invalid, 2567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 00:50:56,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-24 00:50:56,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 332. [2024-10-24 00:50:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 256 states have (on average 1.58203125) internal successors, (405), 260 states have internal predecessors, (405), 55 states have call successors, (55), 17 states have call predecessors, (55), 20 states have return successors, (62), 54 states have call predecessors, (62), 54 states have call successors, (62) [2024-10-24 00:50:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 522 transitions. [2024-10-24 00:50:56,367 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 522 transitions. Word has length 96 [2024-10-24 00:50:56,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:56,368 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 522 transitions. [2024-10-24 00:50:56,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-24 00:50:56,368 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 522 transitions. [2024-10-24 00:50:56,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 00:50:56,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:56,370 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:50:56,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 00:50:56,370 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:56,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:56,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1305764869, now seen corresponding path program 1 times [2024-10-24 00:50:56,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:56,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722079282] [2024-10-24 00:50:56,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:56,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:56,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:56,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:56,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:56,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:56,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:50:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:56,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:50:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:56,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:50:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:56,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 00:50:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:56,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:50:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:56,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:50:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:56,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:50:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:56,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:50:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:56,568 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:50:56,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:56,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722079282] [2024-10-24 00:50:56,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722079282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:56,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:50:56,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:50:56,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460448097] [2024-10-24 00:50:56,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:56,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:50:56,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:56,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:50:56,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:50:56,570 INFO L87 Difference]: Start difference. First operand 332 states and 522 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-24 00:50:58,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:58,913 INFO L93 Difference]: Finished difference Result 768 states and 1221 transitions. [2024-10-24 00:50:58,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:50:58,913 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 97 [2024-10-24 00:50:58,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:58,917 INFO L225 Difference]: With dead ends: 768 [2024-10-24 00:50:58,917 INFO L226 Difference]: Without dead ends: 459 [2024-10-24 00:50:58,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 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:50:58,919 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 903 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 3777 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 4048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 3777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:50:58,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 1342 Invalid, 4048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 3777 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 00:50:58,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-24 00:50:58,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 332. [2024-10-24 00:50:58,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 256 states have (on average 1.58203125) internal successors, (405), 260 states have internal predecessors, (405), 55 states have call successors, (55), 17 states have call predecessors, (55), 20 states have return successors, (61), 54 states have call predecessors, (61), 54 states have call successors, (61) [2024-10-24 00:50:58,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 521 transitions. [2024-10-24 00:50:58,963 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 521 transitions. Word has length 97 [2024-10-24 00:50:58,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:58,963 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 521 transitions. [2024-10-24 00:50:58,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-24 00:50:58,963 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 521 transitions. [2024-10-24 00:50:58,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 00:50:58,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:58,965 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:50:58,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 00:50:58,965 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:58,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:58,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1820728065, now seen corresponding path program 2 times [2024-10-24 00:50:58,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:58,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474435526] [2024-10-24 00:50:58,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:58,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:59,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:59,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:59,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:59,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:59,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:50:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:59,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:50:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:59,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:50:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:59,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 00:50:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:59,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:50:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:59,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:50:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:59,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:50:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:59,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:50:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:50:59,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:59,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474435526] [2024-10-24 00:50:59,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474435526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:59,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:50:59,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:50:59,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672743709] [2024-10-24 00:50:59,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:59,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:50:59,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:59,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:50:59,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:50:59,183 INFO L87 Difference]: Start difference. First operand 332 states and 521 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-24 00:51:01,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:01,285 INFO L93 Difference]: Finished difference Result 770 states and 1227 transitions. [2024-10-24 00:51:01,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:51:01,286 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 98 [2024-10-24 00:51:01,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:01,289 INFO L225 Difference]: With dead ends: 770 [2024-10-24 00:51:01,289 INFO L226 Difference]: Without dead ends: 461 [2024-10-24 00:51:01,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-24 00:51:01,291 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 899 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 3830 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 4098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 3830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:01,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 1343 Invalid, 4098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 3830 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 00:51:01,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-10-24 00:51:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 334. [2024-10-24 00:51:01,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 257 states have (on average 1.5797665369649805) internal successors, (406), 262 states have internal predecessors, (406), 55 states have call successors, (55), 17 states have call predecessors, (55), 21 states have return successors, (66), 54 states have call predecessors, (66), 54 states have call successors, (66) [2024-10-24 00:51:01,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 527 transitions. [2024-10-24 00:51:01,318 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 527 transitions. Word has length 98 [2024-10-24 00:51:01,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:01,318 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 527 transitions. [2024-10-24 00:51:01,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 8 states have internal predecessors, (61), 4 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-24 00:51:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 527 transitions. [2024-10-24 00:51:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 00:51:01,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:01,320 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:01,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 00:51:01,321 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:01,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:01,321 INFO L85 PathProgramCache]: Analyzing trace with hash 797031488, now seen corresponding path program 1 times [2024-10-24 00:51:01,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:01,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849483308] [2024-10-24 00:51:01,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:01,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:01,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:01,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:01,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:01,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:01,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:01,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:01,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:51:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:01,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 00:51:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:01,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:51:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:01,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:51:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:01,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:51:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:01,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:51:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:01,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:01,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849483308] [2024-10-24 00:51:01,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849483308] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:51:01,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107892458] [2024-10-24 00:51:01,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:01,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:51:01,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:51:01,509 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:51:01,511 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:51:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:01,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:51:01,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:51:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:01,790 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:51:01,866 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:01,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107892458] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:51:01,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:51:01,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-10-24 00:51:01,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460526336] [2024-10-24 00:51:01,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:51:01,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 00:51:01,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:01,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 00:51:01,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:51:01,869 INFO L87 Difference]: Start difference. First operand 334 states and 527 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 00:51:03,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:03,478 INFO L93 Difference]: Finished difference Result 923 states and 1539 transitions. [2024-10-24 00:51:03,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 00:51:03,479 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 99 [2024-10-24 00:51:03,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:03,484 INFO L225 Difference]: With dead ends: 923 [2024-10-24 00:51:03,484 INFO L226 Difference]: Without dead ends: 791 [2024-10-24 00:51:03,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:51:03,486 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 1288 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1333 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:03,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1333 Valid, 1268 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 00:51:03,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-10-24 00:51:03,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 649. [2024-10-24 00:51:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 508 states have (on average 1.6358267716535433) internal successors, (831), 513 states have internal predecessors, (831), 119 states have call successors, (119), 17 states have call predecessors, (119), 21 states have return successors, (140), 118 states have call predecessors, (140), 118 states have call successors, (140) [2024-10-24 00:51:03,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1090 transitions. [2024-10-24 00:51:03,520 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1090 transitions. Word has length 99 [2024-10-24 00:51:03,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:03,521 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 1090 transitions. [2024-10-24 00:51:03,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 7 states have internal predecessors, (85), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-24 00:51:03,521 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1090 transitions. [2024-10-24 00:51:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 00:51:03,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:03,524 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:03,542 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:51:03,725 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:51:03,725 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:03,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:03,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1731689027, now seen corresponding path program 1 times [2024-10-24 00:51:03,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:03,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024384233] [2024-10-24 00:51:03,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:03,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:03,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:03,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:03,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:03,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:03,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:03,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:03,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:51:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:03,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:51:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:03,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:51:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:03,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:51:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:03,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:51:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:03,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:51:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:03,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:03,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024384233] [2024-10-24 00:51:03,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024384233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:03,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:03,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:51:03,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361853183] [2024-10-24 00:51:03,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:03,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:51:03,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:03,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:51:03,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:51:03,881 INFO L87 Difference]: Start difference. First operand 649 states and 1090 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:05,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:05,170 INFO L93 Difference]: Finished difference Result 1682 states and 2888 transitions. [2024-10-24 00:51:05,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:51:05,170 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2024-10-24 00:51:05,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:05,177 INFO L225 Difference]: With dead ends: 1682 [2024-10-24 00:51:05,177 INFO L226 Difference]: Without dead ends: 1093 [2024-10-24 00:51:05,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 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:51:05,180 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 997 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:05,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 758 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 00:51:05,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2024-10-24 00:51:05,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 961. [2024-10-24 00:51:05,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 756 states have (on average 1.6441798941798942) internal successors, (1243), 761 states have internal predecessors, (1243), 183 states have call successors, (183), 17 states have call predecessors, (183), 21 states have return successors, (214), 182 states have call predecessors, (214), 182 states have call successors, (214) [2024-10-24 00:51:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1640 transitions. [2024-10-24 00:51:05,226 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1640 transitions. Word has length 105 [2024-10-24 00:51:05,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:05,226 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1640 transitions. [2024-10-24 00:51:05,227 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:05,227 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1640 transitions. [2024-10-24 00:51:05,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 00:51:05,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:05,232 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:05,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 00:51:05,232 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:05,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:05,233 INFO L85 PathProgramCache]: Analyzing trace with hash 498299982, now seen corresponding path program 1 times [2024-10-24 00:51:05,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:05,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764860865] [2024-10-24 00:51:05,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:05,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:05,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:05,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:05,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:05,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:05,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:05,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:05,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:51:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:05,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:51:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:05,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:51:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:05,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:51:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:05,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:51:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:05,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:51:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:05,326 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:05,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:05,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764860865] [2024-10-24 00:51:05,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764860865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:05,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:05,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:51:05,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989263705] [2024-10-24 00:51:05,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:05,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:51:05,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:05,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:51:05,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:51:05,328 INFO L87 Difference]: Start difference. First operand 961 states and 1640 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:06,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:06,781 INFO L93 Difference]: Finished difference Result 2431 states and 4206 transitions. [2024-10-24 00:51:06,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:51:06,782 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 106 [2024-10-24 00:51:06,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:06,792 INFO L225 Difference]: With dead ends: 2431 [2024-10-24 00:51:06,792 INFO L226 Difference]: Without dead ends: 1580 [2024-10-24 00:51:06,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 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:51:06,797 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 995 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:06,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 719 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 00:51:06,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2024-10-24 00:51:06,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1448. [2024-10-24 00:51:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1148 states have (on average 1.6489547038327526) internal successors, (1893), 1153 states have internal predecessors, (1893), 278 states have call successors, (278), 17 states have call predecessors, (278), 21 states have return successors, (309), 277 states have call predecessors, (309), 277 states have call successors, (309) [2024-10-24 00:51:06,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 2480 transitions. [2024-10-24 00:51:06,864 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 2480 transitions. Word has length 106 [2024-10-24 00:51:06,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:06,864 INFO L471 AbstractCegarLoop]: Abstraction has 1448 states and 2480 transitions. [2024-10-24 00:51:06,865 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:06,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 2480 transitions. [2024-10-24 00:51:06,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 00:51:06,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:06,872 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:06,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 00:51:06,872 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:06,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:06,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1594337473, now seen corresponding path program 1 times [2024-10-24 00:51:06,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:06,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762988463] [2024-10-24 00:51:06,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:06,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:06,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:06,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:06,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:06,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:06,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:06,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:06,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:51:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:06,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:51:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:06,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:51:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:06,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:51:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:06,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:51:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:06,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:51:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:06,997 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:06,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:06,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762988463] [2024-10-24 00:51:06,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762988463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:06,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:06,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:51:06,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615691886] [2024-10-24 00:51:06,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:06,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:51:06,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:07,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:51:07,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:51:07,001 INFO L87 Difference]: Start difference. First operand 1448 states and 2480 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:08,125 INFO L93 Difference]: Finished difference Result 3533 states and 6165 transitions. [2024-10-24 00:51:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:51:08,125 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2024-10-24 00:51:08,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:08,139 INFO L225 Difference]: With dead ends: 3533 [2024-10-24 00:51:08,139 INFO L226 Difference]: Without dead ends: 2315 [2024-10-24 00:51:08,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 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:51:08,147 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 993 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:08,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 708 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:51:08,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2024-10-24 00:51:08,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2183. [2024-10-24 00:51:08,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2183 states, 1760 states have (on average 1.6534090909090908) internal successors, (2910), 1765 states have internal predecessors, (2910), 401 states have call successors, (401), 17 states have call predecessors, (401), 21 states have return successors, (448), 400 states have call predecessors, (448), 400 states have call successors, (448) [2024-10-24 00:51:08,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 3759 transitions. [2024-10-24 00:51:08,264 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 3759 transitions. Word has length 107 [2024-10-24 00:51:08,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:08,264 INFO L471 AbstractCegarLoop]: Abstraction has 2183 states and 3759 transitions. [2024-10-24 00:51:08,264 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:08,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 3759 transitions. [2024-10-24 00:51:08,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 00:51:08,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:08,273 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:08,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 00:51:08,273 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:08,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:08,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1339328049, now seen corresponding path program 1 times [2024-10-24 00:51:08,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:08,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025462067] [2024-10-24 00:51:08,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:08,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:08,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:08,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:08,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:08,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:08,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:08,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:08,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:51:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:08,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:51:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:08,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:51:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:08,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:51:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:08,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:51:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:08,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:51:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:08,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:08,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025462067] [2024-10-24 00:51:08,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025462067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:08,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:08,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:51:08,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107261429] [2024-10-24 00:51:08,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:08,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:51:08,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:08,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:51:08,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:51:08,377 INFO L87 Difference]: Start difference. First operand 2183 states and 3759 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:09,616 INFO L93 Difference]: Finished difference Result 5243 states and 9215 transitions. [2024-10-24 00:51:09,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:51:09,616 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-10-24 00:51:09,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:09,636 INFO L225 Difference]: With dead ends: 5243 [2024-10-24 00:51:09,636 INFO L226 Difference]: Without dead ends: 3487 [2024-10-24 00:51:09,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 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:51:09,644 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 992 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:09,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 707 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:51:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2024-10-24 00:51:09,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 3355. [2024-10-24 00:51:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3355 states, 2753 states have (on average 1.6563748637849618) internal successors, (4560), 2758 states have internal predecessors, (4560), 580 states have call successors, (580), 17 states have call predecessors, (580), 21 states have return successors, (653), 579 states have call predecessors, (653), 579 states have call successors, (653) [2024-10-24 00:51:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 5793 transitions. [2024-10-24 00:51:09,786 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 5793 transitions. Word has length 108 [2024-10-24 00:51:09,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:09,787 INFO L471 AbstractCegarLoop]: Abstraction has 3355 states and 5793 transitions. [2024-10-24 00:51:09,787 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:09,787 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 5793 transitions. [2024-10-24 00:51:09,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 00:51:09,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:09,797 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:09,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 00:51:09,798 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:09,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:09,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1800473179, now seen corresponding path program 1 times [2024-10-24 00:51:09,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:09,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015223515] [2024-10-24 00:51:09,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:09,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:09,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:09,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:09,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:09,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:09,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:09,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:09,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:51:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:09,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:51:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:09,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:51:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:09,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:51:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:09,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:51:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:09,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:51:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:09,985 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:09,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:09,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015223515] [2024-10-24 00:51:09,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015223515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:09,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:09,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:51:09,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080739814] [2024-10-24 00:51:09,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:09,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:51:09,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:09,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:51:09,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:51:09,989 INFO L87 Difference]: Start difference. First operand 3355 states and 5793 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:11,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:11,393 INFO L93 Difference]: Finished difference Result 8098 states and 14269 transitions. [2024-10-24 00:51:11,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:51:11,394 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-10-24 00:51:11,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:11,453 INFO L225 Difference]: With dead ends: 8098 [2024-10-24 00:51:11,453 INFO L226 Difference]: Without dead ends: 5457 [2024-10-24 00:51:11,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 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:51:11,463 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 990 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:11,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 735 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 00:51:11,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5457 states. [2024-10-24 00:51:11,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5457 to 5325. [2024-10-24 00:51:11,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5325 states, 4347 states have (on average 1.6450425580860364) internal successors, (7151), 4352 states have internal predecessors, (7151), 956 states have call successors, (956), 17 states have call predecessors, (956), 21 states have return successors, (1073), 955 states have call predecessors, (1073), 955 states have call successors, (1073) [2024-10-24 00:51:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5325 states to 5325 states and 9180 transitions. [2024-10-24 00:51:11,713 INFO L78 Accepts]: Start accepts. Automaton has 5325 states and 9180 transitions. Word has length 109 [2024-10-24 00:51:11,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:11,714 INFO L471 AbstractCegarLoop]: Abstraction has 5325 states and 9180 transitions. [2024-10-24 00:51:11,714 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 5325 states and 9180 transitions. [2024-10-24 00:51:11,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 00:51:11,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:11,735 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:11,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 00:51:11,736 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:11,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:11,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1720358579, now seen corresponding path program 1 times [2024-10-24 00:51:11,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:11,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700164962] [2024-10-24 00:51:11,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:11,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:11,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:11,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:11,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:11,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:11,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:11,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:11,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:51:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:11,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:51:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:11,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:51:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:11,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:51:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:11,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:51:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:11,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:51:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:11,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:11,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700164962] [2024-10-24 00:51:11,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700164962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:11,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:11,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:51:11,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749548841] [2024-10-24 00:51:11,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:11,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:51:11,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:11,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:51:11,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:51:11,842 INFO L87 Difference]: Start difference. First operand 5325 states and 9180 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:13,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:13,195 INFO L93 Difference]: Finished difference Result 13235 states and 23290 transitions. [2024-10-24 00:51:13,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:51:13,196 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-10-24 00:51:13,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:13,238 INFO L225 Difference]: With dead ends: 13235 [2024-10-24 00:51:13,238 INFO L226 Difference]: Without dead ends: 8990 [2024-10-24 00:51:13,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 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:51:13,251 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 988 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:13,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 710 Invalid, 1638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1313 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:51:13,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8990 states. [2024-10-24 00:51:13,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8990 to 8858. [2024-10-24 00:51:13,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8858 states, 7274 states have (on average 1.642425075611768) internal successors, (11947), 7279 states have internal predecessors, (11947), 1562 states have call successors, (1562), 17 states have call predecessors, (1562), 21 states have return successors, (1757), 1561 states have call predecessors, (1757), 1561 states have call successors, (1757) [2024-10-24 00:51:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8858 states to 8858 states and 15266 transitions. [2024-10-24 00:51:13,687 INFO L78 Accepts]: Start accepts. Automaton has 8858 states and 15266 transitions. Word has length 110 [2024-10-24 00:51:13,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:13,687 INFO L471 AbstractCegarLoop]: Abstraction has 8858 states and 15266 transitions. [2024-10-24 00:51:13,688 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:13,688 INFO L276 IsEmpty]: Start isEmpty. Operand 8858 states and 15266 transitions. [2024-10-24 00:51:13,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 00:51:13,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:13,707 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:13,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 00:51:13,708 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:13,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:13,708 INFO L85 PathProgramCache]: Analyzing trace with hash 9796137, now seen corresponding path program 1 times [2024-10-24 00:51:13,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:13,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120908530] [2024-10-24 00:51:13,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:13,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:13,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:13,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:13,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:13,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:13,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:13,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:13,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:51:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:13,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:51:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:13,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:51:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:13,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:51:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:13,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:51:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:13,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 00:51:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:13,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:13,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120908530] [2024-10-24 00:51:13,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120908530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:13,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:13,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:51:13,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492260448] [2024-10-24 00:51:13,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:13,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:51:13,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:13,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:51:13,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:51:13,840 INFO L87 Difference]: Start difference. First operand 8858 states and 15266 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:15,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:15,194 INFO L93 Difference]: Finished difference Result 23007 states and 40424 transitions. [2024-10-24 00:51:15,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:51:15,194 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 111 [2024-10-24 00:51:15,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:15,265 INFO L225 Difference]: With dead ends: 23007 [2024-10-24 00:51:15,265 INFO L226 Difference]: Without dead ends: 15662 [2024-10-24 00:51:15,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 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:51:15,294 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 986 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:15,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 754 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:51:15,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15662 states. [2024-10-24 00:51:15,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15662 to 15530. [2024-10-24 00:51:15,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15530 states, 12743 states have (on average 1.6328964921917917) internal successors, (20808), 12748 states have internal predecessors, (20808), 2765 states have call successors, (2765), 17 states have call predecessors, (2765), 21 states have return successors, (3104), 2764 states have call predecessors, (3104), 2764 states have call successors, (3104) [2024-10-24 00:51:16,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15530 states to 15530 states and 26677 transitions. [2024-10-24 00:51:16,018 INFO L78 Accepts]: Start accepts. Automaton has 15530 states and 26677 transitions. Word has length 111 [2024-10-24 00:51:16,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:16,019 INFO L471 AbstractCegarLoop]: Abstraction has 15530 states and 26677 transitions. [2024-10-24 00:51:16,020 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand 15530 states and 26677 transitions. [2024-10-24 00:51:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 00:51:16,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:16,042 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:16,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 00:51:16,043 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:16,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:16,044 INFO L85 PathProgramCache]: Analyzing trace with hash 800556372, now seen corresponding path program 1 times [2024-10-24 00:51:16,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:16,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376472705] [2024-10-24 00:51:16,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:16,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:16,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:16,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:16,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:16,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:16,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:16,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:16,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:51:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:16,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:51:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:16,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:51:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:16,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:51:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:16,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:51:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:16,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 00:51:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:16,149 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:16,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:16,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376472705] [2024-10-24 00:51:16,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376472705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:16,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:16,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:51:16,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302802309] [2024-10-24 00:51:16,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:16,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:51:16,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:16,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:51:16,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:51:16,152 INFO L87 Difference]: Start difference. First operand 15530 states and 26677 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:17,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:17,920 INFO L93 Difference]: Finished difference Result 41174 states and 72224 transitions. [2024-10-24 00:51:17,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:51:17,923 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2024-10-24 00:51:17,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:18,051 INFO L225 Difference]: With dead ends: 41174 [2024-10-24 00:51:18,051 INFO L226 Difference]: Without dead ends: 27777 [2024-10-24 00:51:18,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 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:51:18,101 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 984 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:18,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 709 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 00:51:18,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27777 states. [2024-10-24 00:51:19,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27777 to 27645. [2024-10-24 00:51:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27645 states, 22819 states have (on average 1.628993382707393) internal successors, (37172), 22824 states have internal predecessors, (37172), 4804 states have call successors, (4804), 17 states have call predecessors, (4804), 21 states have return successors, (5417), 4803 states have call predecessors, (5417), 4803 states have call successors, (5417) [2024-10-24 00:51:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27645 states to 27645 states and 47393 transitions. [2024-10-24 00:51:19,352 INFO L78 Accepts]: Start accepts. Automaton has 27645 states and 47393 transitions. Word has length 112 [2024-10-24 00:51:19,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:19,352 INFO L471 AbstractCegarLoop]: Abstraction has 27645 states and 47393 transitions. [2024-10-24 00:51:19,352 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, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:19,353 INFO L276 IsEmpty]: Start isEmpty. Operand 27645 states and 47393 transitions. [2024-10-24 00:51:19,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 00:51:19,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:19,380 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:19,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 00:51:19,380 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:19,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:19,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1466732651, now seen corresponding path program 1 times [2024-10-24 00:51:19,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:19,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473594677] [2024-10-24 00:51:19,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:19,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:19,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:19,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:19,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:19,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:19,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:19,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:19,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:51:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:19,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:51:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:19,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:51:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:19,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:51:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:19,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:51:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:19,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 00:51:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:19,499 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:19,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:19,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473594677] [2024-10-24 00:51:19,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473594677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:19,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:19,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:51:19,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624251576] [2024-10-24 00:51:19,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:19,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:51:19,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:19,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:51:19,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:51:19,502 INFO L87 Difference]: Start difference. First operand 27645 states and 47393 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:21,990 INFO L93 Difference]: Finished difference Result 75366 states and 131413 transitions. [2024-10-24 00:51:21,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:51:21,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2024-10-24 00:51:21,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:22,385 INFO L225 Difference]: With dead ends: 75366 [2024-10-24 00:51:22,385 INFO L226 Difference]: Without dead ends: 50601 [2024-10-24 00:51:22,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 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:51:22,462 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 981 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:22,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 724 Invalid, 1655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 00:51:22,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50601 states. [2024-10-24 00:51:24,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50601 to 50469. [2024-10-24 00:51:24,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50469 states, 41928 states have (on average 1.6238790307193283) internal successors, (68086), 41933 states have internal predecessors, (68086), 8519 states have call successors, (8519), 17 states have call predecessors, (8519), 21 states have return successors, (9664), 8518 states have call predecessors, (9664), 8518 states have call successors, (9664) [2024-10-24 00:51:24,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50469 states to 50469 states and 86269 transitions. [2024-10-24 00:51:24,896 INFO L78 Accepts]: Start accepts. Automaton has 50469 states and 86269 transitions. Word has length 113 [2024-10-24 00:51:24,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:24,896 INFO L471 AbstractCegarLoop]: Abstraction has 50469 states and 86269 transitions. [2024-10-24 00:51:24,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:24,897 INFO L276 IsEmpty]: Start isEmpty. Operand 50469 states and 86269 transitions. [2024-10-24 00:51:24,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-24 00:51:24,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:24,921 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:24,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 00:51:24,921 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:24,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:24,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1724829332, now seen corresponding path program 1 times [2024-10-24 00:51:24,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:24,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994060164] [2024-10-24 00:51:24,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:24,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:24,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:24,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:24,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:24,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:25,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:25,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:25,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:51:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:25,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:51:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:25,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:51:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:25,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:51:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:25,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:51:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:25,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 00:51:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:25,040 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:25,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:25,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994060164] [2024-10-24 00:51:25,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994060164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:25,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:25,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:51:25,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21737728] [2024-10-24 00:51:25,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:25,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:51:25,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:25,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:51:25,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:51:25,044 INFO L87 Difference]: Start difference. First operand 50469 states and 86269 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:28,104 INFO L93 Difference]: Finished difference Result 94113 states and 164576 transitions. [2024-10-24 00:51:28,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:51:28,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2024-10-24 00:51:28,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:28,487 INFO L225 Difference]: With dead ends: 94113 [2024-10-24 00:51:28,487 INFO L226 Difference]: Without dead ends: 93981 [2024-10-24 00:51:28,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:51:28,524 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 976 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:28,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 724 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 00:51:28,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93981 states. [2024-10-24 00:51:31,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93981 to 93849. [2024-10-24 00:51:31,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93849 states, 78509 states have (on average 1.6173559719267854) internal successors, (126977), 78514 states have internal predecessors, (126977), 15318 states have call successors, (15318), 17 states have call predecessors, (15318), 21 states have return successors, (17509), 15317 states have call predecessors, (17509), 15317 states have call successors, (17509) [2024-10-24 00:51:32,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93849 states to 93849 states and 159804 transitions. [2024-10-24 00:51:32,171 INFO L78 Accepts]: Start accepts. Automaton has 93849 states and 159804 transitions. Word has length 114 [2024-10-24 00:51:32,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:32,171 INFO L471 AbstractCegarLoop]: Abstraction has 93849 states and 159804 transitions. [2024-10-24 00:51:32,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:32,171 INFO L276 IsEmpty]: Start isEmpty. Operand 93849 states and 159804 transitions. [2024-10-24 00:51:32,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 00:51:32,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:32,198 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:32,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 00:51:32,198 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:32,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:32,199 INFO L85 PathProgramCache]: Analyzing trace with hash -178140854, now seen corresponding path program 1 times [2024-10-24 00:51:32,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:32,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005572494] [2024-10-24 00:51:32,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:32,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:51:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:51:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:51:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:51:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:51:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 00:51:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,390 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:32,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:32,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005572494] [2024-10-24 00:51:32,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005572494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:32,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:32,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 00:51:32,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276778795] [2024-10-24 00:51:32,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:32,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 00:51:32,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:32,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 00:51:32,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:51:32,392 INFO L87 Difference]: Start difference. First operand 93849 states and 159804 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:36,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:36,808 INFO L93 Difference]: Finished difference Result 94348 states and 163858 transitions. [2024-10-24 00:51:36,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 00:51:36,808 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-10-24 00:51:36,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:37,224 INFO L225 Difference]: With dead ends: 94348 [2024-10-24 00:51:37,225 INFO L226 Difference]: Without dead ends: 94223 [2024-10-24 00:51:37,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2024-10-24 00:51:37,277 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1496 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 3818 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 4164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 3818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:37,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 960 Invalid, 4164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 3818 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 00:51:37,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94223 states. [2024-10-24 00:51:40,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94223 to 93976. [2024-10-24 00:51:40,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93976 states, 78609 states have (on average 1.6172066811688228) internal successors, (127127), 78614 states have internal predecessors, (127127), 15334 states have call successors, (15334), 26 states have call predecessors, (15334), 32 states have return successors, (17529), 15335 states have call predecessors, (17529), 15332 states have call successors, (17529) [2024-10-24 00:51:41,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93976 states to 93976 states and 159990 transitions. [2024-10-24 00:51:41,219 INFO L78 Accepts]: Start accepts. Automaton has 93976 states and 159990 transitions. Word has length 115 [2024-10-24 00:51:41,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:41,220 INFO L471 AbstractCegarLoop]: Abstraction has 93976 states and 159990 transitions. [2024-10-24 00:51:41,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 93976 states and 159990 transitions. [2024-10-24 00:51:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 00:51:41,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:41,248 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:41,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 00:51:41,249 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:41,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:41,249 INFO L85 PathProgramCache]: Analyzing trace with hash -260306574, now seen corresponding path program 1 times [2024-10-24 00:51:41,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:41,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42824831] [2024-10-24 00:51:41,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:41,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:51:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:51:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:51:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:51:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:51:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 00:51:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,524 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:41,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:41,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42824831] [2024-10-24 00:51:41,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42824831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:41,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:41,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 00:51:41,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434013229] [2024-10-24 00:51:41,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:41,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 00:51:41,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:41,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 00:51:41,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:51:41,527 INFO L87 Difference]: Start difference. First operand 93976 states and 159990 transitions. Second operand has 14 states, 12 states have (on average 6.166666666666667) internal successors, (74), 9 states have internal predecessors, (74), 7 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-24 00:51:46,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:46,326 INFO L93 Difference]: Finished difference Result 94829 states and 164634 transitions. [2024-10-24 00:51:46,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-24 00:51:46,327 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.166666666666667) internal successors, (74), 9 states have internal predecessors, (74), 7 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Word has length 116 [2024-10-24 00:51:46,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:46,877 INFO L225 Difference]: With dead ends: 94829 [2024-10-24 00:51:46,877 INFO L226 Difference]: Without dead ends: 94269 [2024-10-24 00:51:46,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=302, Invalid=1258, Unknown=0, NotChecked=0, Total=1560 [2024-10-24 00:51:46,903 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 1427 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 4830 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 5228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 4830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:46,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 1621 Invalid, 5228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 4830 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 00:51:46,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94269 states. [2024-10-24 00:51:49,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94269 to 94013. [2024-10-24 00:51:50,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94013 states, 78638 states have (on average 1.6171189501258934) internal successors, (127167), 78646 states have internal predecessors, (127167), 15340 states have call successors, (15340), 27 states have call predecessors, (15340), 34 states have return successors, (17539), 15339 states have call predecessors, (17539), 15338 states have call successors, (17539) [2024-10-24 00:51:50,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94013 states to 94013 states and 160046 transitions. [2024-10-24 00:51:50,312 INFO L78 Accepts]: Start accepts. Automaton has 94013 states and 160046 transitions. Word has length 116 [2024-10-24 00:51:50,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:50,313 INFO L471 AbstractCegarLoop]: Abstraction has 94013 states and 160046 transitions. [2024-10-24 00:51:50,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.166666666666667) internal successors, (74), 9 states have internal predecessors, (74), 7 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-24 00:51:50,313 INFO L276 IsEmpty]: Start isEmpty. Operand 94013 states and 160046 transitions. [2024-10-24 00:51:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 00:51:50,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:50,341 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:50,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 00:51:50,341 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:50,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:50,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1999580928, now seen corresponding path program 1 times [2024-10-24 00:51:50,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:50,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979297527] [2024-10-24 00:51:50,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:50,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:50,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:50,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:50,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:50,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:50,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:50,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:50,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:51:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:50,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:51:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:50,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:51:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:50,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:51:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:50,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 00:51:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:50,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 00:51:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:50,571 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:50,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:50,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979297527] [2024-10-24 00:51:50,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979297527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:50,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:50,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:51:50,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4490505] [2024-10-24 00:51:50,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:50,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:51:50,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:50,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:51:50,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:51:50,575 INFO L87 Difference]: Start difference. First operand 94013 states and 160046 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 00:51:55,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:55,390 INFO L93 Difference]: Finished difference Result 94877 states and 164681 transitions. [2024-10-24 00:51:55,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-24 00:51:55,390 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2024-10-24 00:51:55,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted.