./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_spec3_product25.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_spec3_product25.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 7d9bd30209b011511ea69bcafefe21478bc06dd6e294313a5c1455634308a9dd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 00:49:23,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 00:49:23,359 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 00:49:23,366 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 00:49:23,368 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 00:49:23,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 00:49:23,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 00:49:23,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 00:49:23,399 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 00:49:23,401 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 00:49:23,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 00:49:23,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 00:49:23,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 00:49:23,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 00:49:23,406 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 00:49:23,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 00:49:23,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 00:49:23,407 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 00:49:23,407 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 00:49:23,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 00:49:23,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 00:49:23,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 00:49:23,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 00:49:23,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 00:49:23,410 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 00:49:23,410 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 00:49:23,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 00:49:23,410 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 00:49:23,411 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 00:49:23,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 00:49:23,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 00:49:23,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 00:49:23,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:49:23,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 00:49:23,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 00:49:23,415 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 00:49:23,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 00:49:23,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 00:49:23,415 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 00:49:23,415 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 00:49:23,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 00:49:23,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 00:49:23,416 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 -> 7d9bd30209b011511ea69bcafefe21478bc06dd6e294313a5c1455634308a9dd [2024-10-24 00:49:23,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 00:49:23,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 00:49:23,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 00:49:23,702 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 00:49:23,703 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 00:49:23,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product25.cil.c [2024-10-24 00:49:25,151 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 00:49:25,421 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 00:49:25,425 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product25.cil.c [2024-10-24 00:49:25,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48cb475b1/5e0ac5c17ad24df6a51b2c3af1a38fa5/FLAGbd4fe0939 [2024-10-24 00:49:25,464 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48cb475b1/5e0ac5c17ad24df6a51b2c3af1a38fa5 [2024-10-24 00:49:25,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 00:49:25,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 00:49:25,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 00:49:25,470 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 00:49:25,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 00:49:25,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:49:25" (1/1) ... [2024-10-24 00:49:25,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3f6c57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:25, skipping insertion in model container [2024-10-24 00:49:25,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:49:25" (1/1) ... [2024-10-24 00:49:25,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 00:49:26,180 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_spec3_product25.cil.c[64426,64439] [2024-10-24 00:49:26,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:49:26,206 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 00:49:26,216 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2024-10-24 00:49:26,218 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [460] [2024-10-24 00:49:26,219 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [826] [2024-10-24 00:49:26,219 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [844] [2024-10-24 00:49:26,219 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1073] [2024-10-24 00:49:26,219 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2153] [2024-10-24 00:49:26,219 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2202] [2024-10-24 00:49:26,220 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [2548] [2024-10-24 00:49:26,221 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2607] [2024-10-24 00:49:26,221 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2703] [2024-10-24 00:49:26,222 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2991] [2024-10-24 00:49:26,306 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_spec3_product25.cil.c[64426,64439] [2024-10-24 00:49:26,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:49:26,337 INFO L204 MainTranslator]: Completed translation [2024-10-24 00:49:26,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26 WrapperNode [2024-10-24 00:49:26,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 00:49:26,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 00:49:26,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 00:49:26,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 00:49:26,346 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:49:26" (1/1) ... [2024-10-24 00:49:26,385 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:49:26" (1/1) ... [2024-10-24 00:49:26,437 INFO L138 Inliner]: procedures = 131, calls = 207, calls flagged for inlining = 59, calls inlined = 56, statements flattened = 1053 [2024-10-24 00:49:26,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 00:49:26,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 00:49:26,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 00:49:26,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 00:49:26,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (1/1) ... [2024-10-24 00:49:26,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (1/1) ... [2024-10-24 00:49:26,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (1/1) ... [2024-10-24 00:49:26,506 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:49:26,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (1/1) ... [2024-10-24 00:49:26,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (1/1) ... [2024-10-24 00:49:26,532 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (1/1) ... [2024-10-24 00:49:26,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (1/1) ... [2024-10-24 00:49:26,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (1/1) ... [2024-10-24 00:49:26,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (1/1) ... [2024-10-24 00:49:26,579 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 00:49:26,585 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 00:49:26,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 00:49:26,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 00:49:26,587 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (1/1) ... [2024-10-24 00:49:26,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:49:26,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:49:26,625 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:49:26,631 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:49:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2024-10-24 00:49:26,679 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2024-10-24 00:49:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2024-10-24 00:49:26,679 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2024-10-24 00:49:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2024-10-24 00:49:26,679 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2024-10-24 00:49:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-24 00:49:26,680 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-24 00:49:26,680 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-24 00:49:26,680 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-24 00:49:26,681 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-24 00:49:26,681 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-24 00:49:26,681 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-24 00:49:26,681 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-24 00:49:26,682 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-24 00:49:26,682 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-24 00:49:26,682 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-24 00:49:26,682 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-24 00:49:26,683 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-24 00:49:26,683 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-24 00:49:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-24 00:49:26,684 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-24 00:49:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 00:49:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-24 00:49:26,684 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-24 00:49:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-24 00:49:26,685 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-24 00:49:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2024-10-24 00:49:26,685 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2024-10-24 00:49:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-24 00:49:26,686 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-24 00:49:26,686 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-24 00:49:26,686 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-24 00:49:26,686 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-24 00:49:26,686 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-24 00:49:26,686 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-24 00:49:26,686 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-24 00:49:26,686 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-10-24 00:49:26,686 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-10-24 00:49:26,687 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-24 00:49:26,687 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-24 00:49:26,687 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-24 00:49:26,687 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-24 00:49:26,687 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-24 00:49:26,688 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-24 00:49:26,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 00:49:26,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 00:49:26,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 00:49:26,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 00:49:26,688 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-24 00:49:26,688 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-24 00:49:26,688 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2024-10-24 00:49:26,688 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2024-10-24 00:49:26,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 00:49:26,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 00:49:26,916 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 00:49:26,918 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 00:49:27,982 INFO L? ?]: Removed 540 outVars from TransFormulas that were not future-live. [2024-10-24 00:49:27,983 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 00:49:28,050 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 00:49:28,051 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 00:49:28,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:49:28 BoogieIcfgContainer [2024-10-24 00:49:28,051 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 00:49:28,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 00:49:28,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 00:49:28,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 00:49:28,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:49:25" (1/3) ... [2024-10-24 00:49:28,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b13e592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:49:28, skipping insertion in model container [2024-10-24 00:49:28,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (2/3) ... [2024-10-24 00:49:28,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b13e592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:49:28, skipping insertion in model container [2024-10-24 00:49:28,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:49:28" (3/3) ... [2024-10-24 00:49:28,060 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec3_product25.cil.c [2024-10-24 00:49:28,072 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 00:49:28,072 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 00:49:28,151 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 00:49:28,159 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;@3240ab47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 00:49:28,160 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 00:49:28,167 INFO L276 IsEmpty]: Start isEmpty. Operand has 371 states, 283 states have (on average 1.6148409893992932) internal successors, (457), 288 states have internal predecessors, (457), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 00:49:28,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-24 00:49:28,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:28,199 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:28,200 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:28,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:28,206 INFO L85 PathProgramCache]: Analyzing trace with hash 254995704, now seen corresponding path program 1 times [2024-10-24 00:49:28,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:28,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740334572] [2024-10-24 00:49:28,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:28,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:49:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:49:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:49:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 00:49:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 00:49:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 00:49:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:49:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:49:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:49:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:49:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:49:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:49:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 00:49:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 00:49:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:49:29,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:29,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740334572] [2024-10-24 00:49:29,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740334572] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:49:29,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516906846] [2024-10-24 00:49:29,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:29,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:49:29,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:49:29,176 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:49:29,177 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:49:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 00:49:29,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:49:29,580 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-24 00:49:29,581 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:49:29,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516906846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:29,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:49:29,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-24 00:49:29,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041536331] [2024-10-24 00:49:29,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:29,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 00:49:29,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:29,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 00:49:29,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:49:29,627 INFO L87 Difference]: Start difference. First operand has 371 states, 283 states have (on average 1.6148409893992932) internal successors, (457), 288 states have internal predecessors, (457), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:49:29,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:29,750 INFO L93 Difference]: Finished difference Result 557 states and 861 transitions. [2024-10-24 00:49:29,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 00:49:29,753 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 123 [2024-10-24 00:49:29,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:29,766 INFO L225 Difference]: With dead ends: 557 [2024-10-24 00:49:29,767 INFO L226 Difference]: Without dead ends: 367 [2024-10-24 00:49:29,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 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:49:29,775 INFO L432 NwaCegarLoop]: 557 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:29,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 557 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:49:29,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-24 00:49:29,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2024-10-24 00:49:29,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 281 states have (on average 1.601423487544484) internal successors, (450), 284 states have internal predecessors, (450), 62 states have call successors, (62), 24 states have call predecessors, (62), 23 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-24 00:49:29,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 571 transitions. [2024-10-24 00:49:29,850 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 571 transitions. Word has length 123 [2024-10-24 00:49:29,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:29,851 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 571 transitions. [2024-10-24 00:49:29,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:49:29,852 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 571 transitions. [2024-10-24 00:49:29,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 00:49:29,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:29,857 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:29,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 00:49:30,057 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:49:30,058 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:30,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:30,059 INFO L85 PathProgramCache]: Analyzing trace with hash -2120883837, now seen corresponding path program 1 times [2024-10-24 00:49:30,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:30,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011870536] [2024-10-24 00:49:30,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:30,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:49:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:49:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:49:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:49:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 00:49:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 00:49:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:49:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:49:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:49:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:49:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:49:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,401 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:49:30,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:30,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011870536] [2024-10-24 00:49:30,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011870536] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:49:30,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219244643] [2024-10-24 00:49:30,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:30,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:49:30,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:49:30,405 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:49:30,407 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:49:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 00:49:30,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:49:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:49:30,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:49:30,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219244643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:30,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:49:30,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 00:49:30,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508882228] [2024-10-24 00:49:30,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:30,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:49:30,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:30,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:49:30,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:49:30,800 INFO L87 Difference]: Start difference. First operand 367 states and 571 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:49:30,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:30,870 INFO L93 Difference]: Finished difference Result 552 states and 841 transitions. [2024-10-24 00:49:30,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:49:30,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 106 [2024-10-24 00:49:30,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:30,875 INFO L225 Difference]: With dead ends: 552 [2024-10-24 00:49:30,875 INFO L226 Difference]: Without dead ends: 369 [2024-10-24 00:49:30,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 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:49:30,877 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 0 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:30,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1107 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:49:30,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-24 00:49:30,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2024-10-24 00:49:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 283 states have (on average 1.5971731448763251) internal successors, (452), 286 states have internal predecessors, (452), 62 states have call successors, (62), 24 states have call predecessors, (62), 23 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-24 00:49:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 573 transitions. [2024-10-24 00:49:30,903 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 573 transitions. Word has length 106 [2024-10-24 00:49:30,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:30,904 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 573 transitions. [2024-10-24 00:49:30,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:49:30,904 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 573 transitions. [2024-10-24 00:49:30,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 00:49:30,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:30,907 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:30,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 00:49:31,107 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:49:31,108 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:31,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:31,109 INFO L85 PathProgramCache]: Analyzing trace with hash 612300824, now seen corresponding path program 1 times [2024-10-24 00:49:31,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:31,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869391518] [2024-10-24 00:49:31,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:31,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:49:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:49:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:49:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 00:49:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:49:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:49:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:49:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:49:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:49:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:49:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:49:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 00:49:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 00:49:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 00:49:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,401 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-24 00:49:31,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:31,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869391518] [2024-10-24 00:49:31,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869391518] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:49:31,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757347501] [2024-10-24 00:49:31,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:31,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:49:31,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:49:31,404 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:49:31,406 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:49:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 1152 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:49:31,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:49:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-24 00:49:31,780 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:49:31,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757347501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:31,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:49:31,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 00:49:31,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816141844] [2024-10-24 00:49:31,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:31,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:49:31,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:31,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:49:31,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:49:31,782 INFO L87 Difference]: Start difference. First operand 369 states and 573 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:49:31,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:31,857 INFO L93 Difference]: Finished difference Result 786 states and 1238 transitions. [2024-10-24 00:49:31,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:49:31,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 129 [2024-10-24 00:49:31,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:31,861 INFO L225 Difference]: With dead ends: 786 [2024-10-24 00:49:31,861 INFO L226 Difference]: Without dead ends: 439 [2024-10-24 00:49:31,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 158 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:49:31,867 INFO L432 NwaCegarLoop]: 568 mSDtfsCounter, 129 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:31,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1078 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:49:31,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-10-24 00:49:31,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 434. [2024-10-24 00:49:31,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 334 states have (on average 1.6137724550898203) internal successors, (539), 337 states have internal predecessors, (539), 76 states have call successors, (76), 24 states have call predecessors, (76), 23 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2024-10-24 00:49:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 688 transitions. [2024-10-24 00:49:31,908 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 688 transitions. Word has length 129 [2024-10-24 00:49:31,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:31,910 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 688 transitions. [2024-10-24 00:49:31,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:49:31,911 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 688 transitions. [2024-10-24 00:49:31,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 00:49:31,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:31,913 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:31,935 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:49:32,114 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:49:32,115 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:32,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:32,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1049758509, now seen corresponding path program 1 times [2024-10-24 00:49:32,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:32,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826570221] [2024-10-24 00:49:32,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:32,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:49:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:49:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:49:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 00:49:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:49:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:49:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:49:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:49:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:49:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:49:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:49:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:49:32,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:32,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826570221] [2024-10-24 00:49:32,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826570221] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:49:32,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847171293] [2024-10-24 00:49:32,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:32,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:49:32,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:49:32,380 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:49:32,384 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:49:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 1088 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 00:49:32,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:49:32,765 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 00:49:32,767 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:49:32,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847171293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:32,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:49:32,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-24 00:49:32,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330819204] [2024-10-24 00:49:32,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:32,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:49:32,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:32,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:49:32,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:49:32,771 INFO L87 Difference]: Start difference. First operand 434 states and 688 transitions. Second operand has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 00:49:32,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:32,914 INFO L93 Difference]: Finished difference Result 863 states and 1370 transitions. [2024-10-24 00:49:32,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:49:32,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 112 [2024-10-24 00:49:32,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:32,918 INFO L225 Difference]: With dead ends: 863 [2024-10-24 00:49:32,919 INFO L226 Difference]: Without dead ends: 436 [2024-10-24 00:49:32,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:49:32,923 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 2 mSDsluCounter, 1627 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2173 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:49:32,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2173 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:49:32,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-10-24 00:49:32,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2024-10-24 00:49:32,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 335 states have (on average 1.6119402985074627) internal successors, (540), 339 states have internal predecessors, (540), 76 states have call successors, (76), 24 states have call predecessors, (76), 24 states have return successors, (75), 72 states have call predecessors, (75), 73 states have call successors, (75) [2024-10-24 00:49:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 691 transitions. [2024-10-24 00:49:32,950 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 691 transitions. Word has length 112 [2024-10-24 00:49:32,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:32,951 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 691 transitions. [2024-10-24 00:49:32,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 00:49:32,951 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 691 transitions. [2024-10-24 00:49:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 00:49:32,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:32,957 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:32,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 00:49:33,161 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:49:33,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:33,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:33,162 INFO L85 PathProgramCache]: Analyzing trace with hash -701898195, now seen corresponding path program 1 times [2024-10-24 00:49:33,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:33,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673834977] [2024-10-24 00:49:33,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:33,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 00:49:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 00:49:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 00:49:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:49:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:49:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:49:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:49:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:49:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:49:33,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 00:49:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,447 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:49:33,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:33,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673834977] [2024-10-24 00:49:33,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673834977] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:49:33,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886806050] [2024-10-24 00:49:33,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:33,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:49:33,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:49:33,450 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:49:33,451 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:49:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 00:49:33,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:49:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 00:49:33,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:49:33,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886806050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:33,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:49:33,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-24 00:49:33,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064389818] [2024-10-24 00:49:33,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:33,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:49:33,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:33,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:49:33,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:49:33,840 INFO L87 Difference]: Start difference. First operand 436 states and 691 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 00:49:33,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:33,964 INFO L93 Difference]: Finished difference Result 865 states and 1375 transitions. [2024-10-24 00:49:33,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:49:33,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2024-10-24 00:49:33,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:33,969 INFO L225 Difference]: With dead ends: 865 [2024-10-24 00:49:33,969 INFO L226 Difference]: Without dead ends: 438 [2024-10-24 00:49:33,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:49:33,972 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 2 mSDsluCounter, 1615 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:33,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2159 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:49:33,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-10-24 00:49:33,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2024-10-24 00:49:33,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 336 states have (on average 1.6101190476190477) internal successors, (541), 341 states have internal predecessors, (541), 76 states have call successors, (76), 24 states have call predecessors, (76), 25 states have return successors, (80), 72 states have call predecessors, (80), 73 states have call successors, (80) [2024-10-24 00:49:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 697 transitions. [2024-10-24 00:49:33,997 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 697 transitions. Word has length 113 [2024-10-24 00:49:33,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:33,997 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 697 transitions. [2024-10-24 00:49:33,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 00:49:33,998 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 697 transitions. [2024-10-24 00:49:34,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 00:49:34,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:34,026 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:34,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-24 00:49:34,227 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:49:34,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:34,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:34,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1110530901, now seen corresponding path program 1 times [2024-10-24 00:49:34,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:34,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104562925] [2024-10-24 00:49:34,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:34,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:34,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:34,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:34,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:34,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:34,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:34,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 00:49:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:34,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 00:49:34,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:34,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:49:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:34,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:49:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:34,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:49:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:34,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:49:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:34,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:49:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:34,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:49:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:34,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 00:49:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:34,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 00:49:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:34,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 00:49:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:34,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 00:49:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-24 00:49:34,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:34,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104562925] [2024-10-24 00:49:34,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104562925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:34,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:34,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:49:34,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810614955] [2024-10-24 00:49:34,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:34,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:49:34,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:34,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:49:34,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:49:34,482 INFO L87 Difference]: Start difference. First operand 438 states and 697 transitions. Second operand has 9 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-24 00:49:36,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:36,862 INFO L93 Difference]: Finished difference Result 1001 states and 1623 transitions. [2024-10-24 00:49:36,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:49:36,862 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 132 [2024-10-24 00:49:36,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:36,867 INFO L225 Difference]: With dead ends: 1001 [2024-10-24 00:49:36,868 INFO L226 Difference]: Without dead ends: 582 [2024-10-24 00:49:36,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 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:49:36,870 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1242 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 2792 mSolverCounterSat, 445 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 3237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 445 IncrementalHoareTripleChecker+Valid, 2792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:36,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 1198 Invalid, 3237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [445 Valid, 2792 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 00:49:36,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-10-24 00:49:36,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 438. [2024-10-24 00:49:36,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 336 states have (on average 1.6101190476190477) internal successors, (541), 341 states have internal predecessors, (541), 76 states have call successors, (76), 24 states have call predecessors, (76), 25 states have return successors, (79), 72 states have call predecessors, (79), 73 states have call successors, (79) [2024-10-24 00:49:36,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 696 transitions. [2024-10-24 00:49:36,908 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 696 transitions. Word has length 132 [2024-10-24 00:49:36,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:36,909 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 696 transitions. [2024-10-24 00:49:36,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-24 00:49:36,909 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 696 transitions. [2024-10-24 00:49:36,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 00:49:36,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:36,912 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:36,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 00:49:36,912 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:36,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:36,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1010657811, now seen corresponding path program 1 times [2024-10-24 00:49:36,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:36,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019958304] [2024-10-24 00:49:36,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:36,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 00:49:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 00:49:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 00:49:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:49:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:49:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:49:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:49:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:49:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 00:49:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,129 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:49:37,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:37,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019958304] [2024-10-24 00:49:37,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019958304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:37,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:37,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:49:37,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10262760] [2024-10-24 00:49:37,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:37,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:49:37,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:37,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:49:37,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:49:37,131 INFO L87 Difference]: Start difference. First operand 438 states and 696 transitions. Second operand has 9 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 00:49:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:39,256 INFO L93 Difference]: Finished difference Result 1003 states and 1626 transitions. [2024-10-24 00:49:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:49:39,257 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2024-10-24 00:49:39,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:39,262 INFO L225 Difference]: With dead ends: 1003 [2024-10-24 00:49:39,262 INFO L226 Difference]: Without dead ends: 584 [2024-10-24 00:49:39,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 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:49:39,265 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1240 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 2801 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 3244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:39,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 1198 Invalid, 3244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2801 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 00:49:39,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-10-24 00:49:39,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 440. [2024-10-24 00:49:39,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 337 states have (on average 1.6083086053412463) internal successors, (542), 343 states have internal predecessors, (542), 76 states have call successors, (76), 24 states have call predecessors, (76), 26 states have return successors, (81), 72 states have call predecessors, (81), 73 states have call successors, (81) [2024-10-24 00:49:39,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 699 transitions. [2024-10-24 00:49:39,301 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 699 transitions. Word has length 115 [2024-10-24 00:49:39,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:39,301 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 699 transitions. [2024-10-24 00:49:39,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 00:49:39,302 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 699 transitions. [2024-10-24 00:49:39,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 00:49:39,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:39,305 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:39,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 00:49:39,305 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:39,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:39,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1848252912, now seen corresponding path program 1 times [2024-10-24 00:49:39,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:39,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731925964] [2024-10-24 00:49:39,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:39,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:49:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 00:49:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:49:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:49:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:49:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:49:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:49:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 00:49:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 00:49:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 00:49:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 00:49:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-24 00:49:39,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:39,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731925964] [2024-10-24 00:49:39,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731925964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:39,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:39,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:49:39,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644633252] [2024-10-24 00:49:39,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:39,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:49:39,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:39,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:49:39,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:49:39,600 INFO L87 Difference]: Start difference. First operand 440 states and 699 transitions. Second operand has 12 states, 11 states have (on average 7.454545454545454) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (21), 6 states have call predecessors, (21), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-24 00:49:42,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:42,344 INFO L93 Difference]: Finished difference Result 1001 states and 1621 transitions. [2024-10-24 00:49:42,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:49:42,345 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.454545454545454) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (21), 6 states have call predecessors, (21), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 134 [2024-10-24 00:49:42,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:42,349 INFO L225 Difference]: With dead ends: 1001 [2024-10-24 00:49:42,349 INFO L226 Difference]: Without dead ends: 584 [2024-10-24 00:49:42,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 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:49:42,352 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1241 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 4662 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 5106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 4662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:42,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 1663 Invalid, 5106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 4662 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-24 00:49:42,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-10-24 00:49:42,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 440. [2024-10-24 00:49:42,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 337 states have (on average 1.6083086053412463) internal successors, (542), 343 states have internal predecessors, (542), 76 states have call successors, (76), 24 states have call predecessors, (76), 26 states have return successors, (80), 72 states have call predecessors, (80), 73 states have call successors, (80) [2024-10-24 00:49:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 698 transitions. [2024-10-24 00:49:42,386 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 698 transitions. Word has length 134 [2024-10-24 00:49:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:42,386 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 698 transitions. [2024-10-24 00:49:42,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.454545454545454) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (21), 6 states have call predecessors, (21), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-24 00:49:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 698 transitions. [2024-10-24 00:49:42,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 00:49:42,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:42,388 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:42,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 00:49:42,389 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:42,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:42,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1161590432, now seen corresponding path program 1 times [2024-10-24 00:49:42,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:42,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315832147] [2024-10-24 00:49:42,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:42,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:42,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:49:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 00:49:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:49:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:49:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:49:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:49:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:49:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 00:49:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:49:42,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:42,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315832147] [2024-10-24 00:49:42,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315832147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:42,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:42,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:49:42,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754931819] [2024-10-24 00:49:42,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:42,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:49:42,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:42,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:49:42,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:49:42,655 INFO L87 Difference]: Start difference. First operand 440 states and 698 transitions. Second operand has 12 states, 11 states have (on average 7.0) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-24 00:49:45,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:45,546 INFO L93 Difference]: Finished difference Result 1003 states and 1627 transitions. [2024-10-24 00:49:45,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:49:45,547 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 117 [2024-10-24 00:49:45,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:45,552 INFO L225 Difference]: With dead ends: 1003 [2024-10-24 00:49:45,552 INFO L226 Difference]: Without dead ends: 586 [2024-10-24 00:49:45,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 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:49:45,555 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1238 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 4712 mSolverCounterSat, 440 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1239 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 5152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 440 IncrementalHoareTripleChecker+Valid, 4712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:45,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1239 Valid, 1664 Invalid, 5152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [440 Valid, 4712 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-24 00:49:45,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2024-10-24 00:49:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 442. [2024-10-24 00:49:45,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 338 states have (on average 1.606508875739645) internal successors, (543), 345 states have internal predecessors, (543), 76 states have call successors, (76), 24 states have call predecessors, (76), 27 states have return successors, (85), 72 states have call predecessors, (85), 73 states have call successors, (85) [2024-10-24 00:49:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 704 transitions. [2024-10-24 00:49:45,591 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 704 transitions. Word has length 117 [2024-10-24 00:49:45,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:45,591 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 704 transitions. [2024-10-24 00:49:45,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-24 00:49:45,592 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 704 transitions. [2024-10-24 00:49:45,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 00:49:45,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:45,594 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:45,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 00:49:45,594 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:45,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:45,595 INFO L85 PathProgramCache]: Analyzing trace with hash -382099701, now seen corresponding path program 1 times [2024-10-24 00:49:45,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:45,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814195950] [2024-10-24 00:49:45,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:45,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:49:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 00:49:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:49:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:49:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:49:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:49:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:49:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 00:49:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 00:49:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 00:49:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 00:49:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-24 00:49:45,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:45,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814195950] [2024-10-24 00:49:45,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814195950] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:49:45,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006152175] [2024-10-24 00:49:45,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:45,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:49:45,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:49:45,757 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:49:45,758 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:49:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:46,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 1163 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:49:46,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:49:46,103 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-24 00:49:46,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:49:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-24 00:49:46,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006152175] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:49:46,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:49:46,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-10-24 00:49:46,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79133512] [2024-10-24 00:49:46,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:49:46,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 00:49:46,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:46,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 00:49:46,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:49:46,251 INFO L87 Difference]: Start difference. First operand 442 states and 704 transitions. Second operand has 11 states, 11 states have (on average 11.0) internal successors, (121), 7 states have internal predecessors, (121), 2 states have call successors, (42), 6 states have call predecessors, (42), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 00:49:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:48,273 INFO L93 Difference]: Finished difference Result 1189 states and 2004 transitions. [2024-10-24 00:49:48,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 00:49:48,274 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 7 states have internal predecessors, (121), 2 states have call successors, (42), 6 states have call predecessors, (42), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 136 [2024-10-24 00:49:48,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:48,280 INFO L225 Difference]: With dead ends: 1189 [2024-10-24 00:49:48,281 INFO L226 Difference]: Without dead ends: 1006 [2024-10-24 00:49:48,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:49:48,282 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 1736 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 2963 mSolverCounterSat, 623 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1790 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 3586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 623 IncrementalHoareTripleChecker+Valid, 2963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:48,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1790 Valid, 1560 Invalid, 3586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [623 Valid, 2963 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 00:49:48,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2024-10-24 00:49:48,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 847. [2024-10-24 00:49:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 664 states have (on average 1.661144578313253) internal successors, (1103), 671 states have internal predecessors, (1103), 155 states have call successors, (155), 24 states have call predecessors, (155), 27 states have return successors, (174), 151 states have call predecessors, (174), 152 states have call successors, (174) [2024-10-24 00:49:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1432 transitions. [2024-10-24 00:49:48,330 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1432 transitions. Word has length 136 [2024-10-24 00:49:48,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:48,330 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1432 transitions. [2024-10-24 00:49:48,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.0) internal successors, (121), 7 states have internal predecessors, (121), 2 states have call successors, (42), 6 states have call predecessors, (42), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-24 00:49:48,331 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1432 transitions. [2024-10-24 00:49:48,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-24 00:49:48,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:48,336 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:48,354 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:49:48,536 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:49:48,537 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:48,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:48,537 INFO L85 PathProgramCache]: Analyzing trace with hash 390523406, now seen corresponding path program 1 times [2024-10-24 00:49:48,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:48,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546163428] [2024-10-24 00:49:48,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:48,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:49:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:49:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:49:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:49:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:49:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:49:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 00:49:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 00:49:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 00:49:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 00:49:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 00:49:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,648 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-24 00:49:48,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:48,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546163428] [2024-10-24 00:49:48,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546163428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:48,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:48,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:49:48,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984586496] [2024-10-24 00:49:48,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:48,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:49:48,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:48,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:49:48,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:49:48,650 INFO L87 Difference]: Start difference. First operand 847 states and 1432 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:49:50,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:50,064 INFO L93 Difference]: Finished difference Result 2185 states and 3783 transitions. [2024-10-24 00:49:50,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:49:50,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 142 [2024-10-24 00:49:50,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:50,074 INFO L225 Difference]: With dead ends: 2185 [2024-10-24 00:49:50,075 INFO L226 Difference]: Without dead ends: 1398 [2024-10-24 00:49:50,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 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:49:50,078 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 1364 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 507 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 2103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 507 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:50,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 905 Invalid, 2103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [507 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 00:49:50,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-10-24 00:49:50,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1249. [2024-10-24 00:49:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 987 states have (on average 1.6717325227963526) internal successors, (1650), 994 states have internal predecessors, (1650), 234 states have call successors, (234), 24 states have call predecessors, (234), 27 states have return successors, (263), 230 states have call predecessors, (263), 231 states have call successors, (263) [2024-10-24 00:49:50,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 2147 transitions. [2024-10-24 00:49:50,144 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 2147 transitions. Word has length 142 [2024-10-24 00:49:50,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:50,145 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 2147 transitions. [2024-10-24 00:49:50,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:49:50,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 2147 transitions. [2024-10-24 00:49:50,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 00:49:50,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:50,152 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:50,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 00:49:50,153 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:50,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:50,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2032222432, now seen corresponding path program 1 times [2024-10-24 00:49:50,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:50,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634488434] [2024-10-24 00:49:50,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:50,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:49:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:49:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:49:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:49:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:49:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:49:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 00:49:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 00:49:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,258 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:49:50,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:50,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634488434] [2024-10-24 00:49:50,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634488434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:50,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:50,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:49:50,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397797475] [2024-10-24 00:49:50,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:50,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:49:50,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:50,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:49:50,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:49:50,260 INFO L87 Difference]: Start difference. First operand 1249 states and 2147 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:49:51,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:51,737 INFO L93 Difference]: Finished difference Result 3168 states and 5530 transitions. [2024-10-24 00:49:51,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:49:51,738 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-10-24 00:49:51,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:51,749 INFO L225 Difference]: With dead ends: 3168 [2024-10-24 00:49:51,749 INFO L226 Difference]: Without dead ends: 2029 [2024-10-24 00:49:51,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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:49:51,754 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1364 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1569 mSolverCounterSat, 528 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 2097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 528 IncrementalHoareTripleChecker+Valid, 1569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:51,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 886 Invalid, 2097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [528 Valid, 1569 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:49:51,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2024-10-24 00:49:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1880. [2024-10-24 00:49:51,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1499 states have (on average 1.6784523015343562) internal successors, (2516), 1506 states have internal predecessors, (2516), 353 states have call successors, (353), 24 states have call predecessors, (353), 27 states have return successors, (382), 349 states have call predecessors, (382), 350 states have call successors, (382) [2024-10-24 00:49:51,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 3251 transitions. [2024-10-24 00:49:51,842 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 3251 transitions. Word has length 125 [2024-10-24 00:49:51,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:51,843 INFO L471 AbstractCegarLoop]: Abstraction has 1880 states and 3251 transitions. [2024-10-24 00:49:51,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:49:51,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 3251 transitions. [2024-10-24 00:49:51,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 00:49:51,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:51,853 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:51,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 00:49:51,854 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:51,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:51,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1988778286, now seen corresponding path program 1 times [2024-10-24 00:49:51,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:51,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869846001] [2024-10-24 00:49:51,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:51,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:51,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:51,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:51,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:51,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:51,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:51,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:51,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:49:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:51,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:49:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:51,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:49:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:51,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:49:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:51,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:49:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:51,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 00:49:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:51,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 00:49:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:51,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 00:49:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:51,962 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:49:51,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:51,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869846001] [2024-10-24 00:49:51,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869846001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:51,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:51,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:49:51,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802640081] [2024-10-24 00:49:51,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:51,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:49:51,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:51,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:49:51,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:49:51,963 INFO L87 Difference]: Start difference. First operand 1880 states and 3251 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:49:53,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:53,566 INFO L93 Difference]: Finished difference Result 4648 states and 8182 transitions. [2024-10-24 00:49:53,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:49:53,567 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 126 [2024-10-24 00:49:53,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:53,585 INFO L225 Difference]: With dead ends: 4648 [2024-10-24 00:49:53,585 INFO L226 Difference]: Without dead ends: 2998 [2024-10-24 00:49:53,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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:49:53,593 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1361 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 501 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 501 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:53,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 877 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [501 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 00:49:53,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2024-10-24 00:49:53,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2849. [2024-10-24 00:49:53,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2849 states, 2306 states have (on average 1.6843018213356462) internal successors, (3884), 2313 states have internal predecessors, (3884), 515 states have call successors, (515), 24 states have call predecessors, (515), 27 states have return successors, (560), 511 states have call predecessors, (560), 512 states have call successors, (560) [2024-10-24 00:49:53,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2849 states and 4959 transitions. [2024-10-24 00:49:53,731 INFO L78 Accepts]: Start accepts. Automaton has 2849 states and 4959 transitions. Word has length 126 [2024-10-24 00:49:53,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:53,731 INFO L471 AbstractCegarLoop]: Abstraction has 2849 states and 4959 transitions. [2024-10-24 00:49:53,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:49:53,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2849 states and 4959 transitions. [2024-10-24 00:49:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-24 00:49:53,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:53,745 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:53,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 00:49:53,746 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:53,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:53,746 INFO L85 PathProgramCache]: Analyzing trace with hash 629922397, now seen corresponding path program 1 times [2024-10-24 00:49:53,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:53,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189320948] [2024-10-24 00:49:53,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:53,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:49:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:49:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:49:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:49:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:49:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:49:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 00:49:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 00:49:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 00:49:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 00:49:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 00:49:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-24 00:49:53,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:53,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189320948] [2024-10-24 00:49:53,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189320948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:53,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:53,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:49:53,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711256674] [2024-10-24 00:49:53,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:53,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:49:53,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:53,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:49:53,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:49:53,904 INFO L87 Difference]: Start difference. First operand 2849 states and 4959 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:49:55,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:55,389 INFO L93 Difference]: Finished difference Result 6988 states and 12387 transitions. [2024-10-24 00:49:55,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:49:55,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2024-10-24 00:49:55,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:55,417 INFO L225 Difference]: With dead ends: 6988 [2024-10-24 00:49:55,418 INFO L226 Difference]: Without dead ends: 4566 [2024-10-24 00:49:55,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 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:49:55,457 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1359 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1579 mSolverCounterSat, 506 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 2085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 506 IncrementalHoareTripleChecker+Valid, 1579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:55,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 879 Invalid, 2085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [506 Valid, 1579 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:49:55,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4566 states. [2024-10-24 00:49:55,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4566 to 4417. [2024-10-24 00:49:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4417 states, 3629 states have (on average 1.6886194543951503) internal successors, (6128), 3636 states have internal predecessors, (6128), 760 states have call successors, (760), 24 states have call predecessors, (760), 27 states have return successors, (831), 756 states have call predecessors, (831), 757 states have call successors, (831) [2024-10-24 00:49:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4417 states to 4417 states and 7719 transitions. [2024-10-24 00:49:55,639 INFO L78 Accepts]: Start accepts. Automaton has 4417 states and 7719 transitions. Word has length 145 [2024-10-24 00:49:55,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:55,640 INFO L471 AbstractCegarLoop]: Abstraction has 4417 states and 7719 transitions. [2024-10-24 00:49:55,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:49:55,640 INFO L276 IsEmpty]: Start isEmpty. Operand 4417 states and 7719 transitions. [2024-10-24 00:49:55,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-24 00:49:55,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:55,658 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:55,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 00:49:55,659 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:55,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:55,659 INFO L85 PathProgramCache]: Analyzing trace with hash 888494192, now seen corresponding path program 1 times [2024-10-24 00:49:55,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:55,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721148955] [2024-10-24 00:49:55,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:55,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:49:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:49:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:49:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:49:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:49:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:49:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 00:49:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 00:49:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 00:49:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 00:49:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 00:49:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,786 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-24 00:49:55,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:55,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721148955] [2024-10-24 00:49:55,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721148955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:55,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:55,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:49:55,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429633513] [2024-10-24 00:49:55,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:55,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:49:55,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:55,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:49:55,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:49:55,789 INFO L87 Difference]: Start difference. First operand 4417 states and 7719 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:49:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:57,321 INFO L93 Difference]: Finished difference Result 10941 states and 19454 transitions. [2024-10-24 00:49:57,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:49:57,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2024-10-24 00:49:57,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:57,364 INFO L225 Difference]: With dead ends: 10941 [2024-10-24 00:49:57,365 INFO L226 Difference]: Without dead ends: 7238 [2024-10-24 00:49:57,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 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:49:57,382 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 1354 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:57,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1372 Valid, 899 Invalid, 2119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:49:57,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7238 states. [2024-10-24 00:49:57,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7238 to 7089. [2024-10-24 00:49:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7089 states, 5808 states have (on average 1.6825068870523416) internal successors, (9772), 5815 states have internal predecessors, (9772), 1253 states have call successors, (1253), 24 states have call predecessors, (1253), 27 states have return successors, (1368), 1249 states have call predecessors, (1368), 1250 states have call successors, (1368) [2024-10-24 00:49:57,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7089 states to 7089 states and 12393 transitions. [2024-10-24 00:49:57,799 INFO L78 Accepts]: Start accepts. Automaton has 7089 states and 12393 transitions. Word has length 146 [2024-10-24 00:49:57,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:57,800 INFO L471 AbstractCegarLoop]: Abstraction has 7089 states and 12393 transitions. [2024-10-24 00:49:57,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:49:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 7089 states and 12393 transitions. [2024-10-24 00:49:57,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 00:49:57,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:57,826 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:57,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 00:49:57,826 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:57,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:57,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1373659045, now seen corresponding path program 1 times [2024-10-24 00:49:57,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:57,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051950005] [2024-10-24 00:49:57,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:57,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:49:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:49:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:49:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:49:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:49:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 00:49:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 00:49:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 00:49:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:49:57,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:57,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051950005] [2024-10-24 00:49:57,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051950005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:57,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:57,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:49:57,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047679049] [2024-10-24 00:49:57,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:57,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:49:57,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:57,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:49:57,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:49:57,952 INFO L87 Difference]: Start difference. First operand 7089 states and 12393 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:49:59,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:59,514 INFO L93 Difference]: Finished difference Result 18076 states and 32138 transitions. [2024-10-24 00:49:59,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:49:59,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2024-10-24 00:49:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:59,568 INFO L225 Difference]: With dead ends: 18076 [2024-10-24 00:49:59,568 INFO L226 Difference]: Without dead ends: 12067 [2024-10-24 00:49:59,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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:49:59,596 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1354 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 2088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 510 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:59,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 879 Invalid, 2088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [510 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 00:49:59,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12067 states. [2024-10-24 00:50:00,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12067 to 11918. [2024-10-24 00:50:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11918 states, 9815 states have (on average 1.682322975038207) internal successors, (16512), 9822 states have internal predecessors, (16512), 2075 states have call successors, (2075), 24 states have call predecessors, (2075), 27 states have return successors, (2268), 2071 states have call predecessors, (2268), 2072 states have call successors, (2268) [2024-10-24 00:50:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11918 states to 11918 states and 20855 transitions. [2024-10-24 00:50:00,113 INFO L78 Accepts]: Start accepts. Automaton has 11918 states and 20855 transitions. Word has length 129 [2024-10-24 00:50:00,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:00,113 INFO L471 AbstractCegarLoop]: Abstraction has 11918 states and 20855 transitions. [2024-10-24 00:50:00,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:50:00,115 INFO L276 IsEmpty]: Start isEmpty. Operand 11918 states and 20855 transitions. [2024-10-24 00:50:00,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-24 00:50:00,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:00,148 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:50:00,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 00:50:00,149 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:00,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:00,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1430514050, now seen corresponding path program 1 times [2024-10-24 00:50:00,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:00,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903409417] [2024-10-24 00:50:00,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:00,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:50:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:50:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:50:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:50:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:50:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:50:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:50:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 00:50:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 00:50:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 00:50:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 00:50:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-24 00:50:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-24 00:50:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,269 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-24 00:50:00,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:00,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903409417] [2024-10-24 00:50:00,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903409417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:00,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:50:00,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:50:00,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623272317] [2024-10-24 00:50:00,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:00,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:50:00,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:00,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:50:00,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:50:00,271 INFO L87 Difference]: Start difference. First operand 11918 states and 20855 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:50:02,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:02,063 INFO L93 Difference]: Finished difference Result 28622 states and 50691 transitions. [2024-10-24 00:50:02,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:50:02,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 148 [2024-10-24 00:50:02,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:02,152 INFO L225 Difference]: With dead ends: 28622 [2024-10-24 00:50:02,152 INFO L226 Difference]: Without dead ends: 18739 [2024-10-24 00:50:02,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 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:50:02,193 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1352 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 501 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 2084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 501 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:50:02,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 859 Invalid, 2084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [501 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:50:02,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18739 states. [2024-10-24 00:50:02,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18739 to 18590. [2024-10-24 00:50:02,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18590 states, 15284 states have (on average 1.6601020675215912) internal successors, (25373), 15291 states have internal predecessors, (25373), 3278 states have call successors, (3278), 24 states have call predecessors, (3278), 27 states have return successors, (3615), 3274 states have call predecessors, (3615), 3275 states have call successors, (3615) [2024-10-24 00:50:02,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18590 states to 18590 states and 32266 transitions. [2024-10-24 00:50:02,964 INFO L78 Accepts]: Start accepts. Automaton has 18590 states and 32266 transitions. Word has length 148 [2024-10-24 00:50:02,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:02,965 INFO L471 AbstractCegarLoop]: Abstraction has 18590 states and 32266 transitions. [2024-10-24 00:50:02,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:50:02,965 INFO L276 IsEmpty]: Start isEmpty. Operand 18590 states and 32266 transitions. [2024-10-24 00:50:02,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-24 00:50:02,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:02,994 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:50:02,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 00:50:02,995 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:02,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:02,995 INFO L85 PathProgramCache]: Analyzing trace with hash -866755144, now seen corresponding path program 1 times [2024-10-24 00:50:02,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:02,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688955838] [2024-10-24 00:50:02,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:02,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:03,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:03,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:03,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:03,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:03,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:50:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:03,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:50:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:03,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:50:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:03,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:50:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:03,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:50:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:03,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:50:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:03,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:50:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:03,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 00:50:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:03,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 00:50:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:03,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 00:50:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:03,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 00:50:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:03,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 00:50:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:03,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 00:50:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-24 00:50:03,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:03,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688955838] [2024-10-24 00:50:03,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688955838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:03,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:50:03,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:50:03,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968486493] [2024-10-24 00:50:03,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:03,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:50:03,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:03,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:50:03,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:50:03,149 INFO L87 Difference]: Start difference. First operand 18590 states and 32266 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:50:05,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:05,225 INFO L93 Difference]: Finished difference Result 49255 states and 87012 transitions. [2024-10-24 00:50:05,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:50:05,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 149 [2024-10-24 00:50:05,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:05,365 INFO L225 Difference]: With dead ends: 49255 [2024-10-24 00:50:05,365 INFO L226 Difference]: Without dead ends: 33320 [2024-10-24 00:50:05,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 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:50:05,420 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1351 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1370 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 2089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 00:50:05,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1370 Valid, 878 Invalid, 2089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 00:50:05,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33320 states. [2024-10-24 00:50:06,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33320 to 33171. [2024-10-24 00:50:06,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33171 states, 27415 states have (on average 1.657340871785519) internal successors, (45436), 27422 states have internal predecessors, (45436), 5728 states have call successors, (5728), 24 states have call predecessors, (5728), 27 states have return successors, (6339), 5724 states have call predecessors, (6339), 5725 states have call successors, (6339) [2024-10-24 00:50:06,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33171 states to 33171 states and 57503 transitions. [2024-10-24 00:50:06,969 INFO L78 Accepts]: Start accepts. Automaton has 33171 states and 57503 transitions. Word has length 149 [2024-10-24 00:50:06,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:06,970 INFO L471 AbstractCegarLoop]: Abstraction has 33171 states and 57503 transitions. [2024-10-24 00:50:06,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:50:06,970 INFO L276 IsEmpty]: Start isEmpty. Operand 33171 states and 57503 transitions. [2024-10-24 00:50:07,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 00:50:07,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:07,008 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:50:07,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 00:50:07,008 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:07,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:07,009 INFO L85 PathProgramCache]: Analyzing trace with hash -148839638, now seen corresponding path program 1 times [2024-10-24 00:50:07,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:07,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790556632] [2024-10-24 00:50:07,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:07,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:07,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:07,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:07,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:07,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:07,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:50:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:07,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:50:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:07,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:50:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:07,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:50:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:07,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:50:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:07,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:50:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:07,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 00:50:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:07,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 00:50:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:07,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 00:50:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:07,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 00:50:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:50:07,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:07,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790556632] [2024-10-24 00:50:07,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790556632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:07,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:50:07,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:50:07,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461689055] [2024-10-24 00:50:07,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:07,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:50:07,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:07,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:50:07,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:50:07,111 INFO L87 Difference]: Start difference. First operand 33171 states and 57503 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:50:10,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:10,111 INFO L93 Difference]: Finished difference Result 90557 states and 159236 transitions. [2024-10-24 00:50:10,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:50:10,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2024-10-24 00:50:10,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:10,378 INFO L225 Difference]: With dead ends: 90557 [2024-10-24 00:50:10,378 INFO L226 Difference]: Without dead ends: 60932 [2024-10-24 00:50:10,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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:50:10,621 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1350 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 511 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 2097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 511 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:50:10,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 885 Invalid, 2097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [511 Valid, 1586 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 00:50:10,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60932 states. [2024-10-24 00:50:12,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60932 to 60783. [2024-10-24 00:50:12,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60783 states, 50514 states have (on average 1.6536405748901295) internal successors, (83532), 50521 states have internal predecessors, (83532), 10241 states have call successors, (10241), 24 states have call predecessors, (10241), 27 states have return successors, (11384), 10237 states have call predecessors, (11384), 10238 states have call successors, (11384) [2024-10-24 00:50:13,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60783 states to 60783 states and 105157 transitions. [2024-10-24 00:50:13,409 INFO L78 Accepts]: Start accepts. Automaton has 60783 states and 105157 transitions. Word has length 132 [2024-10-24 00:50:13,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:13,410 INFO L471 AbstractCegarLoop]: Abstraction has 60783 states and 105157 transitions. [2024-10-24 00:50:13,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:50:13,411 INFO L276 IsEmpty]: Start isEmpty. Operand 60783 states and 105157 transitions. [2024-10-24 00:50:13,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 00:50:13,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:13,459 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:50:13,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 00:50:13,459 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:13,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:13,460 INFO L85 PathProgramCache]: Analyzing trace with hash 423398298, now seen corresponding path program 1 times [2024-10-24 00:50:13,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:13,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664257653] [2024-10-24 00:50:13,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:13,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:13,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:13,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:13,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:13,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:13,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:50:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:13,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:50:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:13,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:50:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:13,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:50:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:13,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:50:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:13,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:50:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:13,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 00:50:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:13,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 00:50:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:13,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 00:50:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:13,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 00:50:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:50:13,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:13,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664257653] [2024-10-24 00:50:13,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664257653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:13,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:50:13,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:50:13,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913262117] [2024-10-24 00:50:13,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:13,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:50:13,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:13,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:50:13,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:50:13,570 INFO L87 Difference]: Start difference. First operand 60783 states and 105157 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:50:17,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:17,440 INFO L93 Difference]: Finished difference Result 113909 states and 200846 transitions. [2024-10-24 00:50:17,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:50:17,441 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 133 [2024-10-24 00:50:17,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:17,984 INFO L225 Difference]: With dead ends: 113909 [2024-10-24 00:50:17,984 INFO L226 Difference]: Without dead ends: 113726 [2024-10-24 00:50:18,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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:50:18,036 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 1347 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 504 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 2084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 504 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:50:18,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1365 Valid, 891 Invalid, 2084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [504 Valid, 1580 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:50:18,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113726 states. [2024-10-24 00:50:21,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113726 to 113577. [2024-10-24 00:50:21,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113577 states, 94940 states have (on average 1.6488729724036233) internal successors, (156544), 94947 states have internal predecessors, (156544), 18609 states have call successors, (18609), 24 states have call predecessors, (18609), 27 states have return successors, (20798), 18605 states have call predecessors, (20798), 18606 states have call successors, (20798) [2024-10-24 00:50:22,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113577 states to 113577 states and 195951 transitions. [2024-10-24 00:50:22,287 INFO L78 Accepts]: Start accepts. Automaton has 113577 states and 195951 transitions. Word has length 133 [2024-10-24 00:50:22,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:22,288 INFO L471 AbstractCegarLoop]: Abstraction has 113577 states and 195951 transitions. [2024-10-24 00:50:22,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:50:22,288 INFO L276 IsEmpty]: Start isEmpty. Operand 113577 states and 195951 transitions. [2024-10-24 00:50:22,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 00:50:22,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:22,348 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:50:22,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 00:50:22,349 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:22,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:22,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1288998667, now seen corresponding path program 1 times [2024-10-24 00:50:22,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:22,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506227321] [2024-10-24 00:50:22,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:22,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:22,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:22,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:22,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:23,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:23,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:50:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:23,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:50:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:23,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:50:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:23,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:50:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:23,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:50:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:23,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:50:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:23,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 00:50:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:23,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 00:50:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:23,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 00:50:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:23,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 00:50:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:23,227 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:50:23,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:23,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506227321] [2024-10-24 00:50:23,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506227321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:23,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:50:23,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 00:50:23,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161288928] [2024-10-24 00:50:23,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:23,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 00:50:23,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:23,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 00:50:23,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:50:23,230 INFO L87 Difference]: Start difference. First operand 113577 states and 195951 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 00:50:30,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:30,470 INFO L93 Difference]: Finished difference Result 114772 states and 201285 transitions. [2024-10-24 00:50:30,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-24 00:50:30,471 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 134 [2024-10-24 00:50:30,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:31,284 INFO L225 Difference]: With dead ends: 114772 [2024-10-24 00:50:31,284 INFO L226 Difference]: Without dead ends: 114596 [2024-10-24 00:50:31,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=366, Invalid=1116, Unknown=0, NotChecked=0, Total=1482 [2024-10-24 00:50:31,350 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 3153 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 6664 mSolverCounterSat, 1139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3153 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 7803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1139 IncrementalHoareTripleChecker+Valid, 6664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:50:31,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3153 Valid, 1157 Invalid, 7803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1139 Valid, 6664 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-24 00:50:31,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114596 states. [2024-10-24 00:50:35,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114596 to 114073. [2024-10-24 00:50:35,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114073 states, 95314 states have (on average 1.6483727469207041) internal successors, (157113), 95327 states have internal predecessors, (157113), 18687 states have call successors, (18687), 63 states have call predecessors, (18687), 71 states have return successors, (20893), 18682 states have call predecessors, (20893), 18679 states have call successors, (20893) [2024-10-24 00:50:35,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114073 states to 114073 states and 196693 transitions. [2024-10-24 00:50:36,005 INFO L78 Accepts]: Start accepts. Automaton has 114073 states and 196693 transitions. Word has length 134 [2024-10-24 00:50:36,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:36,006 INFO L471 AbstractCegarLoop]: Abstraction has 114073 states and 196693 transitions. [2024-10-24 00:50:36,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 00:50:36,006 INFO L276 IsEmpty]: Start isEmpty. Operand 114073 states and 196693 transitions. [2024-10-24 00:50:36,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 00:50:36,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:36,069 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:50:36,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 00:50:36,069 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:36,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:36,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1605247712, now seen corresponding path program 1 times [2024-10-24 00:50:36,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:36,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467497879] [2024-10-24 00:50:36,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:36,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:36,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:36,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:36,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:36,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:36,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:50:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:36,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:50:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:36,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:50:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:36,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:50:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:36,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:50:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:36,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:50:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:36,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 00:50:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:36,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 00:50:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:36,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 00:50:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:36,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 00:50:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:36,384 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:50:36,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:36,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467497879] [2024-10-24 00:50:36,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467497879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:36,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:50:36,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-24 00:50:36,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628280636] [2024-10-24 00:50:36,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:36,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 00:50:36,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:36,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 00:50:36,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2024-10-24 00:50:36,386 INFO L87 Difference]: Start difference. First operand 114073 states and 196693 transitions. Second operand has 16 states, 14 states have (on average 6.428571428571429) internal successors, (90), 10 states have internal predecessors, (90), 7 states have call successors, (18), 8 states have call predecessors, (18), 2 states have return successors, (14), 5 states have call predecessors, (14), 6 states have call successors, (14)